This post is completed by 2 users Login To Mark Completed

0

Add to List Add To List..(Max 5) Close Save

Medium

In a Binary Tree, Check if two nodes are Cousins

Objective: Given a binary tree and two nodes, Check if they are cousins

Input: A binary tree and two nodes

Cousin Nodes: Cousin nodes are the nodes who are at the same level in the tree and whose parents are siblings.

Example:

Approach:

• Check the height of both the nodes, if heights are different then return false.
• Check if both the nodes has the same parent, if yes then return false.
• else return true.

Run This Code

Code:

Node 2 and Node 3 are cousins??? false
Node 7 and Node 9 are cousins??? true

---

---

Also Read:

- Convert a Sorted Doubly Linked List to Balanced BST. Medium
- Maximum difference between two elements where larger element appears after the smaller element Medium
- Sorted Array to Binary Search Tree of Minimal Height Medium
- Print the Vertical Sum in binary Tree Medium
- Print the Binary Tree in Vertical Order Path. Medium
- Number of Islands Medium
- Print All Nodes Between Two Given Levels Medium
- Binary Tree - Preorder Traversal - Non Recursive Approach Beginner

---