728x90
๋ฐ์ํ
[LeetCode - Daily Challenge] 993. Cousins in Binary Tree
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given the root of a binary tree with unique values and the values of two different nodes of the tree x and y, return true if the nodes corresponding to the values x and y in the tree are cousins, or false otherwise. Two nodes of a binary tree are cousins if they have the same depth with different parents. Note that in a binary tree, the root node is at the de..
Algorithm/LeetCode Daily Challenge
2021. 10. 20. 10:30
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 71,524
- Today
- 20
- Yesterday
- 397
๋งํฌ
TAG
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- intellij
- Spring Boot
- QueryDSL
- leetcode stack
- ์๊ณ ๋ฆฌ์ฆ
- Linux
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ๋๋ฉ์ธ ์ค๊ณ
- r
- leetcode
- spring boot application
- leetcode binary search
- gRPC
- ์คํ๋ง ๋ถํธ
- ์คํ๋ง๋ถํธ
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- spring boot jwt
- Jackson
- spring boot app
- Spring Data JPA
- ์คํ๋ง ๋ถํธ jwt
- JSON
- Java
- Spring Boot Tutorial
- JPA
- proto3
- leetcode bst
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์