9. Traverse the given tree using Inorder, Preorder and Postorder traversals.
9. Traverse the given tree using Inorder, Preorder and Postorder traversals.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
solve
Transcribed Image Text:Question 3: (Trees)
9. Traverse the given tree using Inorder, Preorder and Postorder traversals.
10. Show how to remove the node with the value 40 from the following binary search tree. Draw the
resulting tree.
85
11. Draw the binary search tree that would result from the insertion of the following integer keys:
14 58 18 10 99 52 33 69 74 17.
12. Generate parse trees for the following expressions.
I.
(A + B) * (D/E)
(A +B^D)/(D-F)+ G
A* (B+ D)/ E- F * (G + H/ K)
II.
II.
13. Represent all the trees shown in questions 9 and 10 by using arrays.
![8. What is the result of the following program execution with the data and operations given
in main( ).
void pop)
{ int item;
if(Top == -1)
{ cout<<"The stack is Empty"<<endl; }
#include <iostream>
using namespace std;
#define MAXSIZE 10
void push(int);
void pop();
void traverse();
int stack[MAXSIZE];
int Top=-1;
int main()
{ int x;
рop();
push(5); push(10); push(20);
push(30); push(40);push(55);
traverse();
pop(); pop();pop); traverse();
x=7;
push(x); push(x*2);
push(3+x);traverse();
х-2*(х-1);
push(x); push(x*2);
push(3+x);traverse();
push(100);traverse(); push(101);
return 0;
else
{ item = stack[Top];
Тор - Тор-1;
}
void traverse()
int i;
if(Top == -1)
{
cout<<"The Stack is Empty"<<endl;
exit(0);
else
{
for(i=0;i<=Top;i++)
{
cout<<stack[i]<<" ";
void push(int item)
cout<<endl;
}
== MAXSIZE - 1)
if(Top
{
cout<<"The Stack Is Full"<<endl;
else
{ Тор- Тор+1;
stack[Top] = item;
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F22560fdf-79be-487f-83d2-863cd2f94d40%2Fc58c4485-5957-4c01-973b-dc64b1442d83%2Fnmhhxar_processed.jpeg&w=3840&q=75)
Transcribed Image Text:8. What is the result of the following program execution with the data and operations given
in main( ).
void pop)
{ int item;
if(Top == -1)
{ cout<<"The stack is Empty"<<endl; }
#include <iostream>
using namespace std;
#define MAXSIZE 10
void push(int);
void pop();
void traverse();
int stack[MAXSIZE];
int Top=-1;
int main()
{ int x;
рop();
push(5); push(10); push(20);
push(30); push(40);push(55);
traverse();
pop(); pop();pop); traverse();
x=7;
push(x); push(x*2);
push(3+x);traverse();
х-2*(х-1);
push(x); push(x*2);
push(3+x);traverse();
push(100);traverse(); push(101);
return 0;
else
{ item = stack[Top];
Тор - Тор-1;
}
void traverse()
int i;
if(Top == -1)
{
cout<<"The Stack is Empty"<<endl;
exit(0);
else
{
for(i=0;i<=Top;i++)
{
cout<<stack[i]<<" ";
void push(int item)
cout<<endl;
}
== MAXSIZE - 1)
if(Top
{
cout<<"The Stack Is Full"<<endl;
else
{ Тор- Тор+1;
stack[Top] = item;
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education