This post is completed by 1 user Login To Mark Completed

0

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

Beginner

Given a binary tree, Print All the Nodes that don't have Siblings.

Objective: Given a binary tree, Print All the Nodes that don't have siblings.

Note: sibling node is the node which has the same parent, so you need to print the nodes who is a single child of his parent.

Input: A binary tree.

Example:

Approach:

• Do the inorder traversal.
• check if the node has only a child, if yes then print that child.

Run This Code

Code:

Output:

Nodes with No Siblings: 6 7 8 9

---

---

Also Read:

- Number of Islands Medium
- Search the Element in a binary tree - With and Without Recursion Beginner
- In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium
- Generate all the strings of length n from 0 to k-1. Medium
- Dynamic Programming - Rod Cutting Problem Medium
- Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node Hard
- Check the completeness of given binary tree | Set 1 - Using Node Count Medium
- Towers Of Hanoi Beginner

---