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:
Print All the Nodes that don’t have siblings.
Approach:
- Do the inorder traversal.
- check if node has only child, if yes then print that child.
Complete Code:
Output:
Nodes with No Siblings: 6 7 8 9
