Scribd
Upload
9 views2 pages

10

This document contains a C program that implements a Binary Search Tree (BST) with functionalities to insert nodes, search for a key, and perform different types of tree traversals (preorder, inorder, postorder). The program allows user interaction through a menu-driven interface to manage the BST. It includes functions for creating new nodes, inserting keys, searching for keys, and displaying the tree in various orders.

Uploaded by

muskaanthakur081
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
9 views2 pages

10

This document contains a C program that implements a Binary Search Tree (BST) with functionalities to insert nodes, search for a key, and perform different types of tree traversals (preorder, inorder, postorder). The program allows user interaction through a menu-driven interface to manage the BST. It includes functions for creating new nodes, inserting keys, searching for keys, and displaying the tree in various orders.

Uploaded by

muskaanthakur081
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

#include<stdio.

h>
#include<stdlib.h>
struct node
{
struct node *left;
int data;
struct node *right;
};
typedef struct node* Node;
Node newNode(int item)
{
Node temp = (Node)malloc(sizeof(struct node));
temp->data = item;
temp->left = temp->right = NULL;
return temp;
}
Node insert(Node node, int key)
{
if (node == NULL)
return newNode(key);
if (key < node->data)
node->left = insert(node->left, key);
else if (key > node->data)
node->right = insert(node->right, key);
return node;
}
int search(Node root, int key)
{
if (root == NULL)
return -1;
if(root->data == key)
return 1;
if (root->data < key)
return search(root->right, key);
return search(root->left, key);
}
void inorder(Node root)
{
if (root != NULL)
{
inorder(root->left);
printf("%d \t", root->data);
inorder(root->right);
}
}
void preorder(Node root)
{
if (root != NULL)
{
printf("%d \t", root->data);
preorder(root->left);
preorder(root->right);
}
}
void postorder(Node root)
{
if (root != NULL)
{
postorder(root->left);
postorder(root->right);
printf("%d \t", root->data);
}
}
int main()
{
int n,i,ch,ch1,key,pos;
Node root=NULL;
printf("Enterthe no of nodes in the BST\n");
scanf("%d",&n);
printf("Enter the element to be inserted\n");
for(i=1;i<=n;i++)
{
scanf("%d",&key);
root=insert(root,key);
}
while(1)
{
printf("\nEnter the choice\n1: Insert Node\n2: Traversal\n3: Search for key\n4:
Exit\n");
scanf("%d",&ch);
switch(ch)
{
case 1:printf("Enter the element to be inserted\n");
scanf("%d",&key);
root=insert(root,key);
break;
case 2:printf("Enter your choice\n1: Preorder\n2: Inorder\n3: Postorder\n");
scanf("%d",&ch1);
switch(ch1)
{
case 1: preorder(root);
break;
case 2:inorder(root);
break;
case 3: postorder(root);
break;
default: printf("\n Make Correct Choice");
}
break;
case 3:printf("Enter the key to be searched\n");
scanf("%d",&key);
pos=search(root,key);
if (pos==-1)
printf("\n Key is not found\n");
else
printf("\n Key is found\n");
break;
case 4: exit(0);
}
}
return 0;
}

You might also like