When to use Preorder, Postorder, and Inorder Binary Search Tree Traversal strategies

Question

I realized recently that while having used BST\'s plenty in my life, I\'ve never even contemplated using anything but Inorder traversal (while I am aware of and know how eas

Answer 1

Pre- and post-order relate to top-down and bottom-up recursive algorithms, respectively. If you want to write a given recursive algorithm on binary trees in an iterative fashion, this is what you will essentially do.

Observe furthermore that pre- and post-order sequences together completely specify the tree at hand, yielding a compact encoding (for sparse trees a least).