a) For the following Binary Search Tree (BST): 27 10 What is returned by the function call A2(root)? b) For the Binary Search Tree (BST) in part (a), what is the content of the queue immediately before returning from the execution of function Ál(roct)? ) Re-write the function A2, in pseudocode, using recursive function.cas. You may not use any form of iter ation. d) For a general Binary Search Tree (BST) of N elements, which of the two algarithms Al and A2, should you use? Give yourchoice and explain your reasoning.

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
icon
Related questions
Question

i need help with the solution and also the explanation

The following two algorithms claim to solve the same problem. To do so, the two
algorithms receive as in input arg ument a reference pointing to a root of a tree:
ALGORITHM 2
Funet i an A2(root)
if (roat - NULL)
returm -1
endif
t= root
while (t.lef t!= NULL) do
t =t. left
end While
returnt.data
End of funet ion A2
ALGORITIM 1
Funetion Al(root)
if (root =- NULL)
return - 1
endif
x = root.data
Q = new Queue)
ENQUEUE (Q, root)
while (!ISEMPTY(Q) do
t= PEEK (Q)
if (t.data <x)
X=t.data
else
EN QUEU E(Q, t.left)
EN QUEU E(Q, tright)
endif
end While
returnx
End of funet ioan Al
Note: the function ENQUEUE only inserts a new element in the
queue if this element is different from NULL.
Transcribed Image Text:The following two algorithms claim to solve the same problem. To do so, the two algorithms receive as in input arg ument a reference pointing to a root of a tree: ALGORITHM 2 Funet i an A2(root) if (roat - NULL) returm -1 endif t= root while (t.lef t!= NULL) do t =t. left end While returnt.data End of funet ion A2 ALGORITIM 1 Funetion Al(root) if (root =- NULL) return - 1 endif x = root.data Q = new Queue) ENQUEUE (Q, root) while (!ISEMPTY(Q) do t= PEEK (Q) if (t.data <x) X=t.data else EN QUEU E(Q, t.left) EN QUEU E(Q, tright) endif end While returnx End of funet ioan Al Note: the function ENQUEUE only inserts a new element in the queue if this element is different from NULL.
a) For the following Binary Search Tree (BST):
32
21
10
45
What is returned by the function call A2(root)?
b) For the Binary Search Tree (BST) in part (a), what is the con tent of the
queue immediately before returning from the execution of function
A1(root)?
e) Re-write the function A2, in pseudocode, using recu rsive function calls.
You may not use any form of iter ation.
d) For a general Binary Search Tree (BST) of N elements, which of the two
algorithms A1 and A2, should you use? Give your choice and explain your
reasoning.
Transcribed Image Text:a) For the following Binary Search Tree (BST): 32 21 10 45 What is returned by the function call A2(root)? b) For the Binary Search Tree (BST) in part (a), what is the con tent of the queue immediately before returning from the execution of function A1(root)? e) Re-write the function A2, in pseudocode, using recu rsive function calls. You may not use any form of iter ation. d) For a general Binary Search Tree (BST) of N elements, which of the two algorithms A1 and A2, should you use? Give your choice and explain your reasoning.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of trees
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education