Its hard enough to find an error in your code when you are looking for it; its even harder when you ve assumed your code is error-free. Steve McConnell

Check internal node of a BST has exactly one child

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


Data structure Description

Write a program to check the given binary search tree internal node has exactly node child or not.


Output

   					 

All Binary Tree Values: 1  2  3  4  
The internal node has exactly one node

				    

Comments


No comments available!

Please login to add comments.