Binary Trees

Task 9
Visit the left sub-tree.
Visit the root node.
Visit the right sub-tree.
Task 10
1.For the current node, check if there is a left sub-tree. If there is, go to the root node for this sub-tree and then go to 2.
2.If there isn’t, go to 3. Repeat 1.
3.Print the current node.
4.For the current node, check whether it has a right sub-tree. If it has, go to 5. else go to 6.
5.Repeat 1.
6.END