5.1.16+State+the+result+of+inorder,+postorder+and+preorder+tree+traversal

Preorder traversal
preorder is:
 * The order in which you would traverse a tree in
 * 1) Visit the root
 * 2) Traverse to the left subtree until the leaf.
 * 3) Traverse to the right subtree || [[image:http://www.cs.purdue.edu/homes/grr/cs251/LectureNotes/Spring2007/week7-1/PreorderTraversal.jpg width="346" height="210"]] ||

Inorder traversal

 * The order in which you would traverse a tree in inorder is:
 * 1) Traverse the left most subtree starting at the left external node.
 * 2) Traverse towards the root but traverse into each right subtree.
 * 3) Traverse the right subtree starting at the left external node, following step 2. || [[image:http://www.cs.purdue.edu/homes/grr/cs251/LectureNotes/Spring2007/week7-1/InorderTraversal.jpg width="346" height="210"]] ||

Postorder traversal
rss url="https://www.diigo.com/rss/user/Rogercompsci/5.1.16" link="true" number="10"
 * The order in which you would traverse a tree in postorder is:
 * 1) Traverse all the left external nodes starting with the left most subtree which is then followed by bubble-up all the internal nodes
 * 2) Traverse the right subtree starting at the left external node which is then followed by bubble-up all the internal nodes
 * 3)  Visit the root || [[image:http://www.cs.purdue.edu/homes/grr/cs251/LectureNotes/Spring2007/week7-1/PostorderTraversal.jpg width="346" height="210"]] ||