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:

- Print All Possible Subsets with Sum equal to a given Number Hard
- Print all steps to convert one string to another string Medium
- Depth First Search/Traversal in Binary Tree Beginner
- Generate All Strings of n bits Medium
- Towers Of Hanoi Beginner
- Print All Paths from Top left to bottom right in Two Dimensional Array Medium
- Print Numbers from 1 to N without using loop Beginner
- AVL Tree - Insertion Hard

---