993. Cousins in Binary Tree
Easy
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 depth 0
, and children of each depth k
node are at the depth k + 1
.
Example 1:
Example 2:
Example 3:
Constraints:
The number of nodes in the tree is in the range
[2, 100]
.1 <= Node.val <= 100
Each node has a unique value.
x != y
x
andy
are exist in the tree.
解題
Runtime: 0 ms, faster than 100%
Memory Usage: 2.5 MB, less than 82.86%
Last updated