Day 7 of 31-Day May LeetCode Challenge

Aanchal Patial
1 min readMay 7, 2020

In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1.

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 x and y of two different nodes in the tree.

Return true if and only if the nodes corresponding to the values x and y are cousins.

--

--

Aanchal Patial

We never really grow up, we only learn how to act in public