Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
4 views

5 Binary Search Tree

Uploaded by

vegetasama9667
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
4 views

5 Binary Search Tree

Uploaded by

vegetasama9667
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 5

/*Implement binary search Tree and perform following operations:

a. Insert
b. Delete
c. Search
d. Mirror image
e. Display
f. Display level wise
*/

#include<iostream>
using namespace std;

typedef struct TreeNode


{
int data;
struct TreeNode *left;
struct TreeNode *right;
}TreeNode;

typedef struct Node


{
struct TreeNode *TreeNode;
struct Node *next;
}Node;

class Queue
{
Node *front,*rear;
public:
Queue()
{
front=NULL;
rear=NULL;
}

int isEmpty()
{
return (front==NULL)?1:0;
}

void enque(TreeNode *t)


{
Node *p;
p=new Node();
p->TreeNode = t;
p->next=NULL;

if(front==NULL)
{
front=p;
rear=p;
}
else
{
rear->next = p;
rear = rear->next;
}
}
TreeNode* deque()
{
Node *p;
TreeNode *temp;
p = front;
temp = front->TreeNode;
if(front==rear)
{
front=NULL;
rear=NULL;
}
else
{
front = front->next;
}
delete p;
return temp;
}
};

class Tree
{
TreeNode *t;
public:
Tree()
{
t=NULL;
}

TreeNode *insert(int x)
{
TreeNode *p,*q,*r;

p = new TreeNode();
p->data=x;
p->left=NULL;
p->right=NULL;

if(t==NULL)
return p;

q=t;
r=t;

while(r!=NULL)
{
q=r;
if(x < r->data)
r=r->left;
else
r=r->right;
}
if(x<q->data)
q->left=p;
else
q->right=p;

return t;
}
TreeNode *create()
{
int n,i,key;
cout<<"\nEnter the number of Nodes : ";
cin>>n;
for(i=0;i<n;i++)
{
cout<<"\nEnter the data : ";
cin>>key;
t=insert(key);
}
return t;
}

void inorder(TreeNode *t)


{
if(t!=NULL)
{
inorder(t->left);
cout<<"\t"<<t->data;
inorder(t->right);
}
}

TreeNode* search(int key)


{
TreeNode *s=t;
while(s!=NULL)
{
if(s->data==key)
return t;
else if(s->data<key)
s=s->right;
else
s=s->left;
}
return NULL;
}

TreeNode *del(TreeNode *t,int key)


{
TreeNode *temp;
if(t==NULL)
{
return NULL;
}
if(key<t->data)
{
t->left=del(t->left,key);
return t;
}
if(key>t->data)
{
t->right=del(t->right,key);
return t;
}
//element found
//no child
if(t->left==NULL&t->right==NULL)
{
temp=t;
delete temp;
return NULL;
}

};
int main()
{
int choice,key;
TreeNode *root,*result;
Tree t;
do
{
cout<<"\n=======================================";
cout<<"\nMENU";
cout<<"\n=======================================";
cout<<"\n1.Create\n2.Insert\n3.Display\n4.Search\n5.Delete\n6.Exit";
cout<<"\n\nEnter your Choice : ";
cin>>choice;
switch(choice)
{
case 1:root = t.create();break;

case 2:
cout<<"\nEnter the number to Insert : ";
cin>>key;
root=t.insert(key);
break;

case 3:
cout<<"\n-----------------------------------------------";
cout<<"\nBINARY TREE :-";
t.inorder(root);
cout<<"\n-----------------------------------------------";
break;

case 4:
cout<<"\n--------------------------";
cout<<"\nEnter the Node to search :";
cin>>key;
result = t.search(key);
if(result==NULL)
{
cout<<"\nNODE "<<key<<" NOT FOUND";
}
else
{
cout<<"\nNODE "<<key<<" IS FOUND";
}
cout<<"\n--------------------------";
break;
case 5:
cout<<"\n--------------------------";
cout<<"\nEnter the Node to delete :";
cin>>key;
result = t.del(root,key);
root=result;
cout<<"\nNODE DELETED !!";
cout<<"\n--------------------------";
break;

case 6:return 0;
default:cout<<"\nInvalid Choice !!";
}
}while(choice!=6);
}

You might also like