## Friday, November 14, 2014

### Binary Search Tree Traversal Algorithms

I Hereby Post My Version Of The Inorder, Preorder And Postorder Code In C++. Please Provide Your Valuable Feedback Or Additions To The Code.

I Am Also Providing A Simple Explanation Here Along With The Download For An Explanation Of How To Perform These Simple Tree Traversals. Please Provide Your Comments On The Documentation As Well.

In  A Binary Search Tree, Every Node Has The Left Subtree With Elements Lesser Than Itself And The Right Subtree Withe Elements Greater Than (Or Equal) To Itself. In A BST, The Tree Can Be Traversed Using The Following Mechanisms.

For A Set Of Elements, That Are Inserted As Mentioned Below, The Inorder Tree Traversal Algorithms Is As Follows. It Is Recursive In Nature And Can Start At Root Always.

1. Traverse the Left Subtree
2. Print the Node
3. Traverse the Right Subtree

Postorder Is A Similar Algorithm In Nature - Except That The Traversal Order Is Different.

1. Traverse the Left Subtree
2. Traverse the Right Subtree
3. Print the Node

Whenever We Want To Traverse The Node Before The Two Subtrees, We Use Pre-Order Traversal.

1. Print the Node
2. Traverse the Left Subtree
3. Traverse the Right Subtree

We Use the Following Insertion Order for All Algorithms Above : 9 7 6 1 3 5 4 2 8

You Can Run the C++ Code to See the Output Yourself. It is Left as an Exercise (or Direct Code Reuse) for the User.