Be the first user to complete this post

  • 0
Add to List

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:

Print All the Nodes that don't have siblings.
Print All the Nodes that don't have siblings.

Approach:

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

Code:


Output:

Nodes with No Siblings: 6 7 8 9



Also Read: