Skip to main content

Threaded Binary Trees

You can download the complete program from here
 
Binary trees need to be traversed using recursion. All the three methods of traversal - inorder, preorder and post order methods employ recursion.

Recursion needs stack storage. In cases where the tree is highly unbalanced, the cost on this traversal would be high.

It would be nice where one could traverse a binary tree without using recursion.

That is where a threaded tree comes into picture. This utilizes the pointers which are wasted on leaf nodes and uses these to save threads pointing to inorder successor or inorder predecessor.

In the diagram above, node A does not have right child. Instead of NULL, a link to B is stored in A->right. Remember that B is the inorder successor of A. Similarly C does not have child nodes. So it has link to predecessor B as left thread and link to D as right thread.

Only A has left link as NULL because A has no predecessor. And I has no successor, so it has right link as NULL.

Types of threaded binary tree

A threaded binary tree can be single or double. A single threaded tree will have either in order successor for   nodes which do  not have a right children or in order predecessor for  nodes which do not have a left children. But not both.

Whereas a double threaded binary tree will have a thread for in order successor, and another thread for in order predecessor whenever a node does not have a left and right child nodes.

The diagram shown above is a double threaded binary tree.

Structure of threaded binary tree node


To differentiate between a thread and a link to child, a boolean is  used. So the threaded tree node will have two extra fields. I have called them  isleftthread and isrightthread. If isleftthread is 1, node->left is a thread to in order successor and it is not a link to child node. But if this value is 0, node->left is a link to left child.

Similarly if node->isrightthread is 1, node->right is a thread. If it is 0, node->right is a child node link.

struct node
{
    int val;
    struct node *left;
    struct node *right;
    int isleftthread;
    int isrightthread;
};


To insert a node into such a tree, you need to do the following
  1. node = root
  2. if node->val > key value, branch to left 
  3. if node->val <key value,  branch to right
  4. Repeat 2 to 3 until you  get a thread (thread means there is no child node present. which means we can insert the new node there)
  5. link the parent to newnode
  6. if newnode is right child of parent
    1. set newnode->right as parent->right (thread)
    2. set newnode->left as parent (thread)
    3. set parent->right as newnode (child)
    4. set parent->isrightthread as 0(false)
  7. if newnode is left child of parent
    1. set newnode->left as parent->left (thread)
    2. set newnode->right as parent (thread)
    3. set parent->left as newnode (child)
    4. set parent->isleftthread as 0(false)
Here is the C code for insert a value into threaded binary tree

NODEPTR insert_node(NODEPTR nd,NODEPTR newnode)
{
     NODEPTR parent = nd;
     NODEPTR root = nd;
     if(root == NULL)
        return newnode;
     while(nd!=NULL)
     {
 
        parent = nd;
        if(newnode->val > nd->val)
        {
        if(nd->isrightthread)
        {
           nd = nd->right;
           break;
         }
        else
           nd = nd->right; 
     }
  
    else if(newnode->val <nd->val){
        if(nd->isleftthread)
        {
          nd = nd->left;
          break;
        }
        else
                 nd = nd->left;
     }
        else
            {
              printf("Duplicate values not allowed");
              return NULL;
            }
     }

Next let us see how we can traverse such a threaded binary tree in order without using recursion.

  1. Traverse to the left most node and find the minimum of the tree.
  2. From this node, use the right link to traverse. 
  3. Repeat until NULL is encountered. 
And here is the code for inorder traversal of threaded binary tree.

void in_order(NODEPTR nd)
{
    /* find extreme left node*/
    while(!nd->isleftthread)
 nd = nd->left;
   /* traverse all nodes till extreme right end*/
    while(nd)
 {
   printf("%d  ",nd->val);
   if(nd->isrightthread)
             nd = nd->right;
          else 
            {
              nd = nd->right;
              while(nd!=NULL && !nd->isleftthread)
                nd = nd->left;
           }
 } 
}
Now we are ready to write the complete program.


#include<stdio.h>
#include<stdlib.h>
struct node
{
   int val;
   struct node *left;
   struct node *right;
   int isleftthread;
   int isrightthread;
};
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;
     temp->isleftthread = 1;
     temp->isrightthread = 1;
     return temp;
}

NODEPTR insert_node(NODEPTR nd,NODEPTR newnode)
{
     NODEPTR parent = nd;
     NODEPTR root = nd;
     if(root == NULL)
        return newnode;
     while(nd!=NULL)
     {
 
 parent = nd;
        if(newnode->val > nd->val)
  {
    if(nd->isrightthread)
   {
   nd = nd->right;
   break;
  }
  else
   nd = nd->right; 
   }
  
        else if(newnode->val <nd->val){
         if(nd->isleftthread)
   {
   nd = nd->left;
   break;
   }
  else
                 nd = nd->left;
  }
        else
            {
  printf("Duplicate values not allowed");
  return NULL;
            }
     }
     if(newnode->val >parent->val)
 {
 newnode->right = parent->right;
 parent->right = newnode;
 parent->isrightthread=0;
 newnode->left = parent;
 }
     else
 {
 newnode->left = parent->left;
  parent->left = newnode;
 parent->isleftthread = 0;
 newnode->right = parent;
 }
     return root;
}
void in_order(NODEPTR nd)
{
    /* find extreme left node*/
    while(!nd->isleftthread)
 nd = nd->left;
   /* traverse all nodes till extreme right end*/
    while(nd)
 {
   printf("%d  ",nd->val);
   if(nd->isrightthread)
             nd = nd->right;
          else 
            {
              nd = nd->right;
              while(nd!=NULL && !nd->isleftthread)
                nd = nd->left;
           }
 } 
}

void pre_order(NODEPTR nd)
{
   if(nd!=NULL)
    {
        printf("%d---",nd->val);   
        pre_order(nd->left);
        pre_order(nd->right);
            
     }
} 
 
int main()
{
       NODEPTR root=NULL,delnode; 
       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("\nInorder traversal\n");
       in_order(root);   
       return 0;
}

Comments

Popular posts from this blog

In order traversal of nodes in the range x to y

Question : Write a function for in-order traversal of nodes in the range x to y from a binary search tree. This is quite a simple function. As a first solution we can just traverse our binary search tree in inorder and display only the nodes which are in the range x to y. But if the current node has a value less than x, do we have to traverse its left subtree? No. Because all the nodes in left subtree will be smaller than x. Similarly if the current node has a key value more than y, we need not visit its right subtree. Now we are ready to write our algorithm.     if nd is NOT NULL  if nd->val >=x then visit all the nodes of left subtree of nd recursively display nd->val if nd->val <y then visit all the nodes of right subtree of nd recursively  That's all. We have our function ready. void in_order_middle (NODEPTR nd, int x, int y) { if (nd) { if (nd -> val >= x) in_order_middle(nd...

Josephus problem

Question: Write a function to delete every k th node from circular linked list until only one node is left. This has a story associated with it. Flavius Josephus was Jewish Historian from 1st century. He and 40 other soldiers were trapped in a cave by Romans. They decided to kill themselves rather than surrendering to Romans. Their method was like this. All the soldiers will stand in a circle and every k th soldier will be shot dead. Josephus said to have calculated the starting point so that he would remain alive. So we have similar problem at hand. We delete every kth node in a circular list. Eventually only one node will be left. e.g. Let us say this is our list And we are deleting every third node.  We will delete 30. Then we delete 60. Next we delete 10. Next it will be 50. Next to be deleted is 20. Next 80. This continues. Implementation   We can count k-1 nodes and delete next node. This can be repeated in  a loop. What must be the termina...

Lowest common ancestor of binary search tree

Question : Write a function to print the lowest common ancestor of two nodes in a binary search tree.  Lowest common ancestor of two nodes x and y in a binary tree is the lowest node that has both x and y as descendants. Here lowest common ancestor of 1 and 7 is 3. LCA of 13 and 7 is root - 8. And LCA of 6 and 7 is 6 itself. The program to find gets complicated for an ordinary binary tree. But for a binary search tree, it is quite simple. As we see from the diagram above, the paths to 1 and 4 are common till the node 3. And at 3 they branch in different directions. So 3 is our LCA. That is lowest common ancestor is the node where the paths to x and y from root deviate. As long as they branch in same direction, we continue to traverse. When they branch in different directions, that is the lowest common ancestor. So let us write a simple algorithm, set temp=root if temp->val >x and temp->val>y temp = temp->left else if temp->val<x and ...