In a binary tree, the root node is at depth
0, and children of each depth
k node are at depth
Two nodes of a binary tree are cousins if they have the same depth, but have different parents.
We are given the
root of a binary tree with unique values, and the values
y of two different nodes in the tree.
true if and only if the nodes corresponding to the values
y are cousins.
Input: root = [1,2,3,4], x = 4, y = 3
Input: root = [1,2,3,null,4,null,5], x = 5, y = 4
Input: root = [1,2,3,null,4], x = 2, y = 3
- The number of nodes in the tree will be between
- Each node has a unique integer value from
# Definition for a binary tree node.