C Program to Search Node in Binary Search Tree without recursion

By | 17.04.2017

Search Node in Binary Tree without recursion 


Write a C Program to Search Node in binary search tree without recursion. Here’s simple Program to Search Node in binary search tree without recursion in C Programming Language.


What is Tree ?


In linear data structure, data is organized in sequential order and in non-linear data structure, data is organized in random order. Tree is a very popular data structure used in wide range of applications.

A tree data structure can be defined as follows…

  • Tree is a non-linear data structure which organizes data in hierarchical structure and this is a recursive definition.

A tree data structure can also be defined as follows…

  • Tree data structure is a collection of data (Node) which is organized in hierarchical structure and this is a recursive definition.

Every individual element is called as Node. Node in a tree data structure, stores the actual data of that particular element and link to next element in hierarchical structure.


Below is the source code for C Program to Search Node in binary search tree without recursion which is successfully compiled and run on Windows System to produce desired output as shown below :


SOURCE CODE : :


/*  C Program to Search Node in binary search tree without recursion  */

#include<stdio.h>
#include<stdlib.h>
#define MAX 50

struct node
{
        struct node *lchild;
        int info;
        struct node *rchild;
};

struct node *search_nrec(struct node *root, int skey);
struct node *insert_nrec(struct node *root, int ikey );
void display(struct node *ptr,int level);


int main( )
{
        struct node *root=NULL, *ptr;
        int choice,k;

        while(1)
        {
                printf("\n");
                printf("1.Search\n");
                printf("2.Insert\n");
                printf("3.Display\n");
                printf("4.Quit\n");
                printf("\nEnter your choice : ");
                scanf("%d",&choice);

                switch(choice)
                {

                case 1:
                        printf("\nEnter the key to be searched : ");
                        scanf("%d",&k);
                        ptr = search_nrec(root, k);
                        if(ptr==NULL)
                                printf("\nKey not present\n");
                        else
                                printf("\nKey present\n");
                        break;

                case 2:
                        printf("\nEnter the key to be inserted : ");
                        scanf("%d",&k);
                        root = insert_nrec(root, k);
                        break;

        case 3:
                        printf("\n");
                        display(root,0);
                        printf("\n");
                        break;

                case 4:
                        exit(1);

                default:
                        printf("\nWrong choice\n");
                }/*End of switch*/
        }/*End of while */

        return 0;

}/*End of main( )*/

struct node *search_nrec(struct node *ptr, int skey)
{
        while(ptr!=NULL)
        {
                if(skey < ptr->info)
                        ptr = ptr->lchild; /*Move to left child*/
                else if(skey > ptr->info)
                        ptr = ptr->rchild;  /*Move to right child */
                else    /*skey found*/
                        return ptr;
        }
        return NULL;
}/*End of search_nrec()*/

struct node *insert_nrec(struct node *root, int ikey)
{
        struct node *tmp,*par,*ptr;

        ptr = root;
        par = NULL;

        while( ptr!=NULL)
        {
                par = ptr;
                if(ikey < ptr->info)
                        ptr = ptr->lchild;
                else if( ikey > ptr->info )
                        ptr = ptr->rchild;
                else
                {
                        printf("Duplicate key");
                        return root;
                }
        }

        tmp=(struct node *)malloc(sizeof(struct node));
        tmp->info=ikey;
        tmp->lchild=NULL;
        tmp->rchild=NULL;

        if(par==NULL)
                root=tmp;
        else if( ikey < par->info )
                par->lchild=tmp;
        else
                par->rchild=tmp;

        return root;
}/*End of insert_nrec( )*/


void display(struct node *ptr,int level)
{
        int i;
        if(ptr == NULL )/*Base Case*/
                return;
        else
    {
                display(ptr->rchild, level+1);
                printf("\n");
                for (i=0; i<level; i++)
                        printf("    ");
                printf("%d", ptr->info);
                display(ptr->lchild, level+1);
        }
}/*End of display()*/

OUTPUT : :


/*  C Program to Search Node in binary search tree without recursion  */

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 2

Enter the key to be inserted : 5

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 2

Enter the key to be inserted : 3

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 2

Enter the key to be inserted : 4

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 2

Enter the key to be inserted : 2

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 2

Enter the key to be inserted : 7

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 2

Enter the key to be inserted : 6

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 2

Enter the key to be inserted : 8

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 3


        8
    7
        6
5
        4
    3
        2

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 1

Enter the key to be searched : 9

Key not present

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 1

Enter the key to be searched : 3

Key present

1.Search
2.Insert
3.Display
4.Quit

Enter your choice : 4

Process returned 1

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may Contact Us through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.


Thanks for reading the post….

0 0 votes
Article Rating
Subscribe
Notify of
guest
0 Comments
Inline Feedbacks
View all comments