Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it. Brian Kernighan

Binary tree lookup

Language Java | Level Intermediate | Category Algorithms | August 3, 2015 10:36 pm


Algorithm Problem Description

A Binary tree is a tree with two nodes left node, right node and root node . The root node is a top most node in the tree.

Write a program to print all the paths in binary tree using Pre-order traversal.

Output

          	        
          	        

All Binary Tree Values: 4   8   10   12   14   20   22   

Print all the Tree paths: 
20, 8, 4
20, 8, 12, 10 
20, 8, 12, 14
20, 22

          	        
          	        				    


Comments



Please login to add comments.