Insert the following numbers into an empty BST and draw the resulting tree: 67, 30, 12, 37. a) What is the height of the tree? b) Is this a perfect binary tree? c) This is not a complete binary tree. Make this a complete tree by inserting the minimal number of nodes needed. Draw your result.

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
1. Insert the following numbers into an empty BST and draw the resulting tree: 67, 30, 12, 37.
a) What is the height of the tree?
b) Is this a perfect binary tree?
c) This is not a complete binary tree.
Make this a complete tree by inserting the minimal number of nodes needed.
Draw your result.
2. Insert the following numbers into an empty BST and draw the resulting tree.
23, 42, 12, 57, 5, 16, 46, 1.
a) What is the height of the tree?
3. Remove the following numbers from the BST from step 2 using lazy removal: 42, 16, 57.
Draw the resulting tree.
a) What is the height of the tree?
4. Now insert the following numbers into the BST from step 3: 40, 20, 16, 42.
Draw the resulting tree.
a) What is the height of the tree?
5. Write an algorithm (in pseudocode) to calculate the height of a tree (including removed
trees).
Transcribed Image Text:1. Insert the following numbers into an empty BST and draw the resulting tree: 67, 30, 12, 37. a) What is the height of the tree? b) Is this a perfect binary tree? c) This is not a complete binary tree. Make this a complete tree by inserting the minimal number of nodes needed. Draw your result. 2. Insert the following numbers into an empty BST and draw the resulting tree. 23, 42, 12, 57, 5, 16, 46, 1. a) What is the height of the tree? 3. Remove the following numbers from the BST from step 2 using lazy removal: 42, 16, 57. Draw the resulting tree. a) What is the height of the tree? 4. Now insert the following numbers into the BST from step 3: 40, 20, 16, 42. Draw the resulting tree. a) What is the height of the tree? 5. Write an algorithm (in pseudocode) to calculate the height of a tree (including removed trees).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

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
  • SEE MORE 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