Build a binary search tree for the following words, sorted alphabetically: gaffe, rebellion, fool, elaborate, spread, joke, freedom, stroke, guideline, and aware. Add words to this tree in the order in which they are listed. (a) How many comparisons are needed to locate spread in this tree, starting from the top? (b) How many comparisons are needed to add the word thorough to this tree? (c) What is the parent of the node labeled elaborate? gaffe rebellion fool elaborate spread joke O freedom O stroke guideline Q aware
Build a binary search tree for the following words, sorted alphabetically: gaffe, rebellion, fool, elaborate, spread, joke, freedom, stroke, guideline, and aware. Add words to this tree in the order in which they are listed. (a) How many comparisons are needed to locate spread in this tree, starting from the top? (b) How many comparisons are needed to add the word thorough to this tree? (c) What is the parent of the node labeled elaborate? gaffe rebellion fool elaborate spread joke O freedom O stroke guideline Q aware
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
Please circle the answer and show how to do it? (BIC 6)
![Build a binary search tree for the following words, sorted alphabetically: gaffe, rebellion, fool, elaborate,
spread, joke, freedom, stroke, guideline, and aware. Add words to this tree in the order in which they are
listed.
(a) How many comparisons are needed to locate spread in this tree, starting from the top?
(b) How many comparisons are needed to add the word thorough to this tree?
(c) What is the parent of the node labeled elaborate?
gaffe
rebellion
fool
elaborate
spread
joke
O freedom
O stroke
guideline
aware
(d) What are the children of the node labeled fool?
O gaffe
O rebellion
O fool
elaborate
Ospread
O joke
freedom
Ostroke
O guideline
O aware](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1b36e76c-f4a3-4d67-a6fb-4428ed1e8db2%2F3a5ea4c7-9a4f-4e60-881f-aec564837045%2F58te4wl_processed.png&w=3840&q=75)
Transcribed Image Text:Build a binary search tree for the following words, sorted alphabetically: gaffe, rebellion, fool, elaborate,
spread, joke, freedom, stroke, guideline, and aware. Add words to this tree in the order in which they are
listed.
(a) How many comparisons are needed to locate spread in this tree, starting from the top?
(b) How many comparisons are needed to add the word thorough to this tree?
(c) What is the parent of the node labeled elaborate?
gaffe
rebellion
fool
elaborate
spread
joke
O freedom
O stroke
guideline
aware
(d) What are the children of the node labeled fool?
O gaffe
O rebellion
O fool
elaborate
Ospread
O joke
freedom
Ostroke
O guideline
O aware
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education