Trend Posts
Author
View LUQMAN's profile
Thursday, October 31, 2013
Write a C++ program to create a class called BIN_TREE(Binary Tree) with member function to perform inorder,preorder and postorder traversals.Create a BIN_TREE object and demonstrate the traversals
-----
#include<iostream.h>
#include<stdlib.h>
#include<conio.h>
struct node
{
int info;
node *llink;
node *rlink;
};
class tree
{
node *root;
public:
tree()
{
root=NULL;
}
void inorder(node *);
void preorder(node *);
void postorder(node *);
void display(int);
void create(int);
};
void tree::display(int choice)
{
switch(choice)
{
case 2:
if(root==NULL)
cout<<"tree is empty"<<endl;
else
{
cout<<"preorder traversal is "<<endl;
preorder(root);
}
break;
case 3:
if(root==NULL)
cout<<"tree is empty"<<endl;
else
{
cout<<"inorder traversal is"<<endl;
inorder(root);
}
break;
case 4:
if(root==NULL)
cout<<"tree is empty"<<endl;
else
{
cout<<"Postorder traversal is"<<endl;
postorder(root);
}
break;
}
}
void tree::inorder(node *root)
{
if(root!=NULL)
{
inorder(root->llink);
cout<<root->info<<endl;
inorder(root->rlink);
}
}
void tree::preorder(node *root)
{
if(root!=NULL)
{
cout<<root->info<<endl;
preorder(root->llink);
preorder(root->rlink);
}
}
void tree::postorder(node *root)
{
if(root!=NULL)
{
postorder(root->llink);
postorder(root->rlink);
cout<<root->info<<endl;
}
}
void tree::create(int item)
{
node *temp,*cur,*prev;
temp=new node;
temp->info=item;
temp->llink=NULL;
temp->rlink=NULL;
if(root==NULL)
{
root=temp;
return;
}
cur=root;
prev=NULL;
while(cur!=NULL)
{
prev=cur;
if(item<cur->info)
cur=cur->llink;
else
cur=cur->rlink;
}
if(item<prev->info)
prev->llink=temp;
else
prev->rlink=temp;
}
void main()
{
tree ob;
int item,choice;
clrscr();
cout<<"1:insert 2:preoder"<<endl;
cout<<"3:inoder 4:postorder"<<endl;
cout<<"5: exit \n";
for(;;)
{
cout<<"enter the choice \n";
cin>>choice;
switch(choice)
{
case 1:
cout<<"enter the item";
cin>>item;
ob.create(item);
break;
case 2:
case 3:
case 4:
ob.display(choice);
break;
default:exit(0);
}
}
}
End programs
<![if !vml]><![endif]><![if !vml]><![endif]>Screenshots:
Saturday, October 26, 2013
//Courtesy : Avinash G, Computer Science Dept.,Srinivas Institute of Technology,Mangalore
----
#include<iostream.h>
#include<conio.h>
#include<process.h>
class list
{
struct node
{
int info;
struct node *next;
};
struct node *plist;
public:
list()
{
plist=NULL;
}
void insert(int);
void del();
void display();
};
void main()
{
list a;
int choice,item;
clrscr();
while(1)
{
cout<<"option are 1.insert 2.delete 3.display 4.exit\n";
cout<<"enter your choice\n";
cin>>choice;
switch(choice)
{
case 1: cout<<"enter the element to be inseted\n";
cin>>item;
a.insert(item);
break;
case 2: a.del();
break;
case 3: a.display();
break;
case 4:exit(0);
}
}
}
void list::insert(int item)
{
struct node *p;
p=new (node);
p->info=item;
p->next=plist;
plist=p;
}
void list::del()
{
struct node *t;
int item;
if(plist==NULL)
cout<<"list is empty\n";
else
{
t=plist;
item=t->info;
cout<<"item removed is "<<item<<"\n";
plist=t->next;
delete(t);
}
}
void list::display()
{
struct node *temp;
if(plist==NULL)
cout<<"list is empty\n";
else
{
cout<<"list elements are ";
for(temp=plist;temp!=NULL;temp=temp->next)
cout<<temp->info<<"\t";
cout<<endl;
}
}
Program Ends
Screen shot:
<![if !vml]>
<![endif]>
<![endif]>
Friday, October 25, 2013
//Courtesy : Avinash G, Computer Science Dept.,Srinivas Institute of Technology,Mangalore
(avinashganiga94@gmail.com)
----------
#include<stdio.h>
#include<conio.h>
#include<process.h>
#include<stdlib.h>
#define MALLOC(p,n,type)\
p=(type*) malloc(n*sizeof(type));\
if(p==NULL)\
{\
printf("Insufficient memory");\
exit(0);\
}
#define COMPARE(x,y) (((x)==(y))?0:((x)>(y))?1:-1)
struct node
{
int coeff;
int expon;
struct node *link;
};
typedef struct node *NODE;
void display(NODE head)
{
NODE temp;
if(head->link==head)
{
printf("polynomial does not exit\n");
return;
}
temp=head->link;
while(temp!=head)
{
if(temp->coeff<0)
printf("%dX^%d",temp->coeff,temp->expon);
else
printf("+%dX^%d",temp->coeff,temp->expon);
temp=temp->link;
}
}
NODE attach(int coeff,int expon,NODE head)
{
NODE temp,cur;
MALLOC(temp,1,struct node);
temp->coeff=coeff;
temp->expon=expon;
cur=head->link;
while(cur->link!=head)
{
cur=cur->link;
}
cur->link=temp;
temp->link=head;
return head;
}
NODE read_poly(NODE head)
{
int i=1,coeff,expon;
printf("Enter the coefficient -999to end the polynomial\n");
while(1)
{
printf("Enter the %d term \n",i++);
printf("coeff=");
scanf("%d",&coeff);
if(coeff==-999)
break;
printf("pow X=");
scanf("%d",&expon);
head=attach(coeff,expon,head);
}
return head;
}
NODE poly_add(NODE head1,NODE head2,NODE head3)
{
NODE a,b;
int coeff;
a=head1->link;
b=head2->link;
while(a!=head1 && b!=head2)
{
switch(COMPARE(a->expon,b->expon))
{
case 0:coeff=a->coeff+b->coeff;
if(coeff!=0)
head3=attach(a->coeff,a->expon,head3);
a=a->link;
b=b->link;
break;
case 1: head3:attach(a->coeff,a->expon,head3);
a=a->link;
break;
default: head3=attach(b->coeff,b->expon,head3);
b=b->link;
}
}
while(a!=head1)
{
head3=attach(a->coeff,a->expon,head3);
a=a->link;
}
while(b!=head2)
{
head3=attach(b->coeff,b->expon,head3);
b=b->link;
}
return head3;
}
void main()
{
clrscr();
NODE head1,head2,head3;
MALLOC(head1,1,struct node);
MALLOC(head3,1,struct node);
MALLOC(head3,1,struct node);
head1->link=head1;
head2->link=head2;
head3->link=head3;
printf("\nEnter the first polynomial\n");
head1=read_poly(head1);
printf("\nEnter the second polynomial\n");
head2=read_poly(head2);
printf("\npolynomial 1:");
display(head1);
printf("\npolynomial 2:");
display(head2);
head3=poly_add(head1,head2,head3);
printf("\npolynomial 3:");
display(head3);
getch();
}
__
Program Ends
Subscribe to:
Posts (Atom)