Cousins in Binary Tree
Shweta2024 opened this issue · 3 comments
Description
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.
Domain
Algorithm
Type of Contribution
Addition
Code of Conduct
- I follow Contributing Guidelines & Code of conduct of LearnCPP.
Hello @Shweta2024, thanks for creating your first issue at LearnCPP, hope you followed the guidelines.
/assign
This issue has been assigned to Shweta2024!
It will become unassigned if it is not closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.