Scribd
Upload
9 views6 pages

Dsa.4 Code Output

The document contains C++ code for an expression tree implementation that supports prefix expressions. It includes functionalities to enter a prefix expression, display the corresponding postfix expression, and delete nodes from the tree. The main function provides a menu-driven interface for user interaction with these functionalities.

Uploaded by

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

Dsa.4 Code Output

The document contains C++ code for an expression tree implementation that supports prefix expressions. It includes functionalities to enter a prefix expression, display the corresponding postfix expression, and delete nodes from the tree. The main function provides a menu-driven interface for user interaction with these functionalities.

Uploaded by

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

Practical No:4

Code:
#include<iostream>

#include<string.h>

using namespace std;

struct node {

char data;

node *left;

node *right;

};

class tree {

public:

node *top; // Root of the expression tree

tree() { top = NULL; } // Initialize top as NULL

void expression(char []);

void display(node *);

void deletion(node *);

};

class stack1 {

public:

node *data[30]; // Stack stores tree nodes

int top;

stack1() { top = -1; }

bool empty() { return (top == -1); }

void push(node *p) { data[++top] = p; }

node *pop() {

if (top == -1) return NULL; // Prevent underflow

return data[top--];

};

void tree::expression(char prefix[]) {


char c;

stack1 s;

node *t1, *t2;

int len, i;

len = strlen(prefix);

for (i = len - 1; i >= 0; i--) {

top = new node;

top->left = NULL;

top->right = NULL;

if (isalpha(prefix[i])) { // Operand

top->data = prefix[i];

s.push(top);

} else if (prefix[i] == '+' || prefix[i] == '-' || prefix[i] == '*' || prefix[i] == '/') {

t1 = s.pop(); // Left operand

t2 = s.pop(); // Right operand

top->data = prefix[i];

top->left = t1; // Correct order

top->right = t2;

s.push(top);

top = s.pop();

void tree::display(node *top) {

if (!top) {

cout << "Tree is empty!\n";

return;

stack1 s1, s2;

node *T = top;

s1.push(T);
while (!s1.empty()) {

T = s1.pop();

s2.push(T);

if (T->left) s1.push(T->left);

if (T->right) s1.push(T->right);

while (!s2.empty()) {

top = s2.pop();

cout << top->data;

cout << endl;

void tree::deletion(node *node) {

if (node == NULL) return;

deletion(node->left);

deletion(node->right);

cout << "Deleting node: " << node->data << endl;

delete node;

int main() {

tree t;

char exp1[20];

int ch;

do {

cout << "1 -> Enter prefix expression" << endl;

cout << "2 -> Display postfix Expression" << endl;

cout << "3 -> Deletion" << endl;

cout << "4 -> Exit" << endl;

cout << "Choose an option (1-4): ";


cin >> ch;

switch (ch) {

case 1:

cout << "Enter the expression (eg.: +--a*bc/def): ";

cin >> exp1;

t.expression(exp1);

break;

case 2:

t.display(t.top);

break;

case 3:

t.deletion(t.top);

t.top = NULL; // Reset tree after deletion

break;

case 4:

cout << "\n// END OF CODE\n" << endl;

break;

default:

cout << "Choose a valid option (1-4)." << endl;

break;

} while (ch != 4);

return 0;

}
Output:
1 -> Enter prefix expression

2 -> Display postfix Expression

3 -> Deletion

4 -> Exit

Choose an option (1-4): 1

Enter the expression (eg.: +--a*bc/def): +__cd

1 -> Enter prefix expression

2 -> Display postfix Expression

3 -> Deletion

4 -> Exit

Choose an option (1-4): 2

cd+

1 -> Enter prefix expression

2 -> Display postfix Expression

3 -> Deletion

4 -> Exit

Choose an option (1-4): 2

cd+

1 -> Enter prefix expression

2 -> Display postfix Expression

3 -> Deletion

4 -> Exit

Choose an option (1-4): 3

Deleting node: c

Deleting node: d

Deleting node: +

1 -> Enter prefix expression

2 -> Display postfix Expression

3 -> Deletion

4 -> Exit
Choose an option (1-4): 2

Tree is empty!

1 -> Enter prefix expression

2 -> Display postfix Expression

3 -> Deletion

4 -> Exit

Choose an option (1-4):

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