4.3.2 Tree-traversal
To meet this assessment you need to be able to:
To meet this assessment you need to be able to:
Be able to trace the tree-traversal algorithms:
pre-order
post-order
in-order.
Be able to describe uses of tree-traversal algorithms.
Pre-Order: copying a tree.
In-Order: binary search tree, outputting the contents of a binary search tree in ascending order.
Post-Order: Infix to RPN (Reverse Polish Notation) conversions, producing a postfix expression from an expression tree, emptying a tree.
Teacher PPT
3-algorithms-binary-tree-search.pptx