It is practically impossible to teach good programming style to students that have had prior exposure to BASIC. As potential programmers, they are mentally mutilated beyond hope of regeneration. E. W. Dijkstra

Print all nodes that donít have sibling

Language Java | Level Intermediate | Category Data structure | September 8, 2015 8:36 am


Data structure Description

Write a program to print all nodes that donít have the sibling.


Output

   					 

All Binary Tree Values: 1 2 3 4  
All nodes that donít have sibling in Binary Tree Values: [4]

				    

Comments


No comments available!

Please login to add comments.