Thursday, April 5, 2012

Inorder Traversal of Binary Search Tree

To traverse a non-empty tree in inorder the following steps are followed recursively.
  • Visit the Root
  • Traverse the left subtree
  • Traverse the right subtree
The inorder traversal of the tree shown below is as follows.


The algorithm for inorder traversal is as follows.

Struct node
struct node * lc;
int data;
struct node * rc;

void inorder(struct node * root);
if(root != NULL)
inorder(root-> lc);

So the function calls itself recursively and carries on the traversal.