Binary-Tree-traversal-using-Java

Sample results: the tree was as follows:
10
9 11
5 3 7 8

the preorder function produced the following result: 10,9,5,3,11,7,8 the post order function produced the following result: 5,3,9,7,8,11,10