Pre Order Traversal
- process the value in the node
- traverse the left subtree
- traverse the right subtree
-
If the program printed the values as it encountered them, it would produce a list beginning with the tree’s middle value. It would then print all of
the lower values, and then all the higher values:
27, 13, 6, 17, 42, 33, 48