Scribd
Upload
14 views6 pages

Practical-4 (Expression Tree)

expression tree traversals

Uploaded by

swati.pingale
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
14 views6 pages

Practical-4 (Expression Tree)

expression tree traversals

Uploaded by

swati.pingale
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/ 6

#include<iostream>

using namespace std;


typedef struct node
{
char data;
struct node *left;
struct node *right;

}node;

typedef struct stacknode


{
node* data;
struct stacknode *next;
}stacknode;

class stack
{
stacknode *top;
public:
stack()
{
top=NULL;
}
node* topp()
{
return (top->data);
}
int isempty()
{
if(top==NULL)
return 1;
return 0;
}

void push(node* a)
{
stacknode *p;
p=new stacknode();
p->data=a;
p->next=top;
top=p;
}

node* pop()
{ stacknode *p;
node* x;
x=top->data;
p=top;
top=top->next;

return x;
}
};

node* create_pre(char prefix[10]);


node* create_post(char postfix[10]);
void inorder_non_recursive(node *t);
void inorder(node *p);
void preorder(node *p);
void postorder(node *p);
void preorder_non_recursive(node *t);
void postorder_non_recursion(node *t);

node* create_post(char postfix[10])


{node *p;
stack s;
for(int i=0;postfix[i]!='\0';i++)
{
char token=postfix[i];
if(isalnum(token))
{
p=new node();
p->data=token;
p->left=NULL;
p->right=NULL;
s.push(p);
}
else
{
p=new node();
p->data=token;
p->right=s.pop();
p->left=s.pop();
s.push(p);
}
}
return s.pop();

node* create_pre(char prefix[10])


{node *p;
stack s;
int i;
for(i=0;prefix[i]!='\0';i++)
{}
i=i-1;
for(;i>=0;i--)
{
char token=prefix[i];
if(isalnum(token))
{
p=new node();
p->data=token;
p->left=NULL;
p->right=NULL;
s.push(p);
}
else
{
p=new node();
p->data=token;
p->left=s.pop();
p->right=s.pop();
s.push(p);
}
}
return s.pop();

int main()
{
node *r=NULL,*r1;
char postfix[10],prefix[10];
int x;
int ch,choice;
do
{
cout<<"\n\t****TREE OPERATIONS****\n1.Construct tree from postfix expression/
prefix expression\n2.Inorder traversal\n3.Preorder traversal\n4.Postorder
traversal\n5.Exit\nEnter your choice=";
cin>>ch;
switch(ch)
{
case 1:cout<<"ENTER CHOICE:\n1.Postfix expression\n2.Prefix expression\
nchoice=";
cin>>choice;
if(choice==1)
{
cout<<"\nEnter postfix expression=";
cin>>postfix;
r=create_post(postfix);
}
else
{
cout<<"\nEnter prefix expression=";
cin>>prefix;
r=create_pre(prefix);
}
cout<<"\n\nTree created successfully";
break;
case 2:cout<<"\nInorder Traversal of tree:\n";
inorder(r);
cout<<"\n Without recursion:\t";
inorder_non_recursive(r);
break;
case 3:cout<<"\nPreorder Traversal of tree:\n";
preorder(r);
cout<<"\npreorder traversal without recursion:\t";
preorder_non_recursive(r);
break;
case 4:cout<<"\nPostorder Traversal of tree:\n";
postorder(r);
cout<<"\npostorder traversal without recursion";
postorder_non_recursion(r);
break;
}
}while(ch!=5);
return 0;
}

void inorder(node *p)


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

void preorder(node *p)


{
if(p!=NULL)
{
cout<<p->data;
preorder(p->left);
preorder(p->right);
}
}

void postorder(node *p)


{
if(p!=NULL)
{
postorder(p->left);
postorder(p->right);
cout<<p->data;
}
}

void inorder_non_recursive(node *t)


{

stack s;
while(t!=NULL)
{
s.push(t);
t=t->left;
}

while(s.isempty()!=1)
{
t=s.pop();
cout<<t->data;
t=t->right;
while(t!=NULL)
{
s.push(t);
t=t->left;
}

}
void preorder_non_recursive(node *t)
{

stack s;
while(t!=NULL)
{
cout<<t->data;
s.push(t);
t=t->left;
}

while(s.isempty()!=1)
{
t=s.pop();

t=t->right;
while(t!=NULL)
{
cout<<t->data;
s.push(t);
t=t->left;
}

}
}

void postorder_non_recursion(node *t)


{stack s,s1;
node *t1;
while(t!=NULL)
{
s.push(t);
s1.push(NULL);
t=t->left;
}
while(s.isempty()!=1)
{
t=s.pop();
t1=s1.pop();
if(t1==NULL)
{
s.push(t);
s1.push((node *)1);
t=t->right;
while(t!=NULL)
{
s.push(t);
s1.push(NULL);
t=t->left;
}

}
else
cout<<t->data;
}
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy