There are two ways of constructing a software design. One way is to make it so simple that there are obviously no deficiencies. And the other way is to make it so complicated that there are no obvious deficiencies. C.A.R. Hoare

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.



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



Please login to add comments.