Ready Project |BCA Project | MCA Project | BBA Project | MBA Project |INDIA'S BIGGEST COLLEGE PROJECT STORE


 #include <stdlib.h>

#include <string.h>

typedef struct node


{

struct node *leftchild;

int info;

struct node *rightchild;

}NODE;

NODE * get_node(int val)

{

NODE *p;

p = (NODE*)malloc(sizeof(NODE));

p->info=val;

p->leftchild = p->rightchild = NULL;

return p;

}

NODE* insert(NODE *h, int key)

{

NODE *p,*q;

q = get_node(key);

if(h==NULL)

h = q;

else

{

p = h;

while(1)

{

if(p->info>q->info)

{

if(p->leftchild==0)

{

p->leftchild = q;

break;

}

else



p=p->leftchild;


}

else

{

if(p->rightchild==0)

{

p->rightchild = q;

break;

}

else

p=p->rightchild;


}

}

}

return h;

}

NODE * create()

{

int i,n,key;

NODE *h=NULL;

printf("Enter no.of keys:");

scanf("%d",&n);

for(i=0;i<n;i++)

{

printf("Enter key:");

scanf("%d",&key);

h = insert(h,key);

}

return h;

}

void preorder(NODE *h)

{

if(h!=NULL)

{

printf("%d\t",h->info);

preorder(h->leftchild);

preorder(h->rightchild);

}

}

NODE* search(NODE *h, int x)

{

NODE *p;

p = h;

while(p!=NULL && p->info!=x)

{

if(p->info>x)

p = p->leftchild;

else

p = p->rightchild;


}

return p;

}


int main()

{

NODE *root;

int ch,key;

while(1)

{

printf("1.Create\n");

printf("2.Display preorder\n");

printf("3.Search\n");

printf("4.Exit\n");

printf("Enter your choice (1-6):");

scanf("%d",&ch);

switch(ch)

{

case 1:

root = create();

break;

case 2:

preorder(root);

printf("\n");

break;

case 3:

printf("Enter key to search:");

scanf("%d",&key);

if(search(root,key)!=NULL)

printf("Key %d found.\n",key);

else

printf("Key % not found.\n",key);

break;

case 4:

exit(0);

}

getch();

}

}


Output-

1.Create

2.Display preorder

3.Search

4.Exit

Enter your choice (1-4):1


Enter no.of keys:2

Enter key:3

Enter key:4

1.Create

2.Display preorder

3.Search

4.Exit

Enter your choice (1-4):2

3 4

1.Create


2.Display preorder

3.Search

4.Exit

Enter your choice (1-4):3

Enter key to search:3

Key 3 found.

1.Create

2.Display preorder

3.Search

4.Exit

Enter your choice (1-4):4

28) Write menu driven program using ‘C’ for Binary Search Tree. The menu includes Create a BST Traverse it by using Preorder traversing technique Search a given value in BST

Search

Project Categories

Recent Posts

Sign In

28) Write menu driven program using ‘C’ for Binary Search Tree. The menu includes
Create a BST
Traverse it by using Preorder traversing technique
Search a given value in BST