4.3.2.1 Simple tree-traversal algorithms

Question 1

What is pre-order traversal?

Answer 1

checks root first, then left subtree then right
can make a complete duplicate of a binary tree.
ILR

Question 2

What is post-order traversal?

Answer 2

left subtree, right subtree, root
Infix to RPN (Reverse Polish Notation) conversions, producing a postfix expression from an expression tree, emptying a tree.
LRI

Question 3

What is in order traversal?

Answer 3

checks left subtree, root, then right
binary search tree, outputting the contents of a binary search tree in ascending order
LIR