Skip to main content

Binary tree traversal in C

In an earlier post, we have seen how to add a new node to a binary tree.

Binary Tree Terminology:

  • Tree is a non-linear data structure where every node has multiple branches
  • A binary tree is a tree where each node has maximum 2 branches
  • Each node branching out is called child node 
  • The starting node of the tree is called root
  • The two children of binary tree are left child and right child.
  • The child node along with its branches and sub-branches are called sub-tree. 
  • A node has two sub-trees - left subtree and right subtree
  • A node which has no child nodes and hence no subtrees is called a leaf node
    Image from : http://msoe.us/taylor

Normally when we talk about binary tree, we refer to binary search tree which is ordered tree.
In a binary search tree, every node to the right of a given node will have larger value than the given node. And every node to the left of given node will have value smaller than given node.
That is to say the left subtree of any node has values smaller than parent and right subtree of any node has values larger than parent.

Tree traversal

In case of lists, stacks or queues, the traversal was simple. Because they are linear data structures. You start from first node, then visit the second node, then third node and so on until last node. Or you can start from last node and come backwards till first node.

But a tree is a non-linear structure. Each node has multiple branches. In case of binary tree, each node has two branches (also called children)- left and right. So which node to we visit after a given node? Its left child ? Or its right child? How do we ensure that we visit all the nodes of the tree and visit these nodes only once?

There are three ways of traversing a tree. 
  1. In order traversal - For any node, 
    1. we visit all the nodes in left subtree of a node, 
    2. visit parent,
    3. visit all nodes in right subtree
  2. Pre order traversal - 
    1. We visit the parent node
    2. visit all nodes of left subtree
    3. visit all nodes of right subtree.
  3. Post order traversal - 
    1. We visit visit all nodes of left subtree
    2. visit all nodes of right subtree
    3. and finally we visit parent node.

Let us write the inorder for the BST given above.

  1. Inorder - 1  -- 3 -- 4 -- 6 -- 7 -- 8 -- 10 -- 13 -- 14
  2. Preorder   8 -- 3 -- 1 -- 6 -- 4 -- 7 -- 10 -- 14 -- 13
  3. Postorder  1 -- 4 -- 7 -- 6 -- 3 -- 13 -- 14 -- 10 -- 8

In inorder, we start with root 8. But before we visit 8, we should visit all nodes of left subtree. So we branch to 3. Before we visit 3, we go to its left child 1. Since 1 has no left child, we print 1. Now we have visited complete left branch of 3. So we print 3 and then we go to 6. Before we print 6, we should go to its left child 4. As 4 is leaf node (node with no children), it is printed. After visiting 4, which is left branch of 6, we can print parent viz 6. Next we go to right branch of 6.

 So you can write down like this.

But a recursive function for these in very simple. Or really very small.



void in_order(NODEPTR nd)
{
   if(nd!=NULL)
    {
        in_order(nd->left);/*visit left subtree*/
        printf("%d---",nd->val);
        in_order(nd->right);/*visit right subtree*/
     }
}

When you run the program, you will notice that, inorder traversal will print the nodes in ascending order of values.

Similarly you can write preorder and postorder traversal functions too.


void pre_order(NODEPTR nd)
{
   if(nd!=NULL)
    {
        printf("%d---",nd->val);   
        pre_order(nd->left);
        pre_order(nd->right);
            
     }
}

void post_order(NODEPTR nd)
{
   if(nd!=NULL)
    {    
 post_order(nd->left);
        post_order(nd->right);
        printf("%d---",nd->val);
     }
}

Here is the complete program.

#include<stdio.h>
#include<stdlib.h>
struct node
{
   int val;
   struct node *left;
   struct node *right;
};
typedef struct node *NODEPTR;

NODEPTR create_node(int num)
{
     NODEPTR temp = (NODEPTR)malloc(sizeof(struct node));
     temp->val = num;
     temp->left = NULL;
     temp->right = NULL;
     return temp;
}

NODEPTR insert_node(NODEPTR nd,NODEPTR newnode)
{
    if(nd==NULL)
       return newnode;/* newnode becomes root of tree*/
    if(newnode->val > nd->val)
        nd->right = insert_node(nd->right,newnode);
    else if(newnode->val <  nd->val)
        nd->left = insert_node(nd->left,newnode); 
    return nd;   
}

void in_order(NODEPTR nd)
{
   if(nd!=NULL)
    {
        in_order(nd->left);
        printf("%d---",nd->val);
        in_order(nd->right);
     }
}

void pre_order(NODEPTR nd)
{
   if(nd!=NULL)
    {
        printf("%d---",nd->val);   
        pre_order(nd->left);
        pre_order(nd->right);
            
     }
}

void post_order(NODEPTR nd)
{
   if(nd!=NULL)
    {    
 post_order(nd->left);
        post_order(nd->right);
        printf("%d---",nd->val);
     }
}

int main()
{
       NODEPTR root=NULL; 
       int n;
       do
       {
           NODEPTR newnode;
           printf("Enter value of node(-1 to exit):");
           scanf("%d",&n);
           if(n!=-1)
            {  
               newnode = create_node(n);
               root = insert_node(root,newnode);
             }
       } while (n!=-1);
       printf("Preorder traversal\n");
       pre_order(root);
       printf("\nInorder traversal\n");
       in_order(root);
       printf("\nPostorder traversal\n");
       post_order(root);
       return 0;
}
Labels:

Comments

Post a Comment

Popular posts from this blog

Program to delete a node from linked list

How do you remove a node from a linked list? If you have to delete a node, first you need to search the node. Then you should find its previous node. Then you should link the previous node to the next node. If node containing 8 has to be deleted, then n1 should be pointing to n2. Looks quite simple. Isn't it? But there are at least two special cases you have to consider. Of course, when the node is not found. If the node is first node of the list viz head. If the node to be deleted is head node, then if you delete, the list would be lost. You should avoid that and make the second node as the head node. So it becomes mandatory that you return the changed head node from the function.   Now let us have a look at the code. #include<stdio.h> #include<stdlib.h> struct node { int data; struct node * next; }; typedef struct node * NODEPTR; NODEPTR create_node ( int value) { NODEPTR temp = (NODEPTR) malloc( size...
3 comments
Read more

Binary tree deletion

Do not get all scared and worried. It is not rocket science (or as I would like to call it - it is not regex). Remember deleting a node from linked list. When you deleted a node, you did the following 2 steps Free the memory of the node Link the previous node of the deleted node to the next node You will have to do these things in binary tree too. But the difficulty here is do you link the previous node - or parent node in tree terminology, to the left child of deleted node? Or to the right child? You can not link both children, as the parent already may have one child node. So before we solve this, let us categorize the deletion with the help of a diagram. Consider the cases The node to be deleted is a leaf node. That is, it does not have left or right child. In this case, link the parent to NULL in place of deleted node.  If you want to delete 13 - which is a leaf node, you set 14->left to NULL and free memory of node 13. If you want to delete 7 - which is also a leaf node and...
Post a Comment
Read more

Function to add a node to binary search tree

Binary search tree (BST) is an ordered tree where each node has smaller values on the left sub tree and larger values on the right subtree. This is similar to binary search algorithm. And another useful fact is if you traverse the node in in-order method, the values of the tree will be in ascending order. Binary Search Tree with root as 50 Now as you can see from the diagram on the left child and their children of root (which in this case is 50), values are 40, 20 and 45. All are less than 50. On the other hand, on the right sub tree 50, the values are 60, 55 and 78 - larger than 50. And this rule follows for each and every node, not just root. Now if we have to  add a node - let us 43, where shall we add it, in such a way that the tree will still remain as BST. The new node must be a leaf node (i.e. the node with no child nodes) Let us traverse from root and find out where this new node fits. 43 is smaller than 50. Hence we must branch to left of 50. Now we get 40. 4...
Post a Comment
Read more