This problem will compare the difference between an ordinary BST (henceforth referred to as just BST) and an AVL Tree. Assume the following: • The problem starts with an empty BST and an empty AVL Tree • Follow a lexicographic/dictionary order on the keys • You will be creating 2 trees by inserting the key values in the sequence they are given. 1 tree will be a BST and the other is an AVL tree After completing all insertions, answer the questions below based on the resulting BST and AVL tree. There are 8 questions so you should have a total of 16 answers (1 answer for BST and 1 answer for AVL). Answer format: • write strings in ALL CAPS (ex. DOG instead of Dog) • write numbers in Arabic numerals (ex. 1 instead of one) • write NIL when referring to an empty node Insert the following key values in this sequence for both trees: BUCKS, WIZARDS, CAVALIERS, RAPTORS, CELTICS, PACERS, HAWKS, NETS, HEAT

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

3. Binary Search Tree and AVL Tree

This problem will compare the difference between an ordinary BST (henceforth
referred to as just BST) and an AVL Tree. Assume the following:
• The problem starts with an empty BST and an empty AVL Tree
• Follow a lexicographic/dictionary order on the keys
• You will be creating 2 trees by inserting the key values in the sequence they are
given. 1 tree will be a BST and the other is an AVL tree
After completing all insertions, answer the questions below based on the resulting
BST and AVL tree. There are 8 questions so you should have a total of 16 answers (1
answer for BST and 1 answer for AVL).
Answer format:
• write strings in ALL CAPS (ex. DOG instead of Dog)
• write numbers in Arabic numerals (ex. 1 instead of one)
• write NIL when referring to an empty node
Insert the following key values in this sequence for both trees: BUCKS, WIZARDS,
CAVALIERS, RAPTORS, CELTICS, PACERS, HAWKS, NETS, HEAT
Transcribed Image Text:This problem will compare the difference between an ordinary BST (henceforth referred to as just BST) and an AVL Tree. Assume the following: • The problem starts with an empty BST and an empty AVL Tree • Follow a lexicographic/dictionary order on the keys • You will be creating 2 trees by inserting the key values in the sequence they are given. 1 tree will be a BST and the other is an AVL tree After completing all insertions, answer the questions below based on the resulting BST and AVL tree. There are 8 questions so you should have a total of 16 answers (1 answer for BST and 1 answer for AVL). Answer format: • write strings in ALL CAPS (ex. DOG instead of Dog) • write numbers in Arabic numerals (ex. 1 instead of one) • write NIL when referring to an empty node Insert the following key values in this sequence for both trees: BUCKS, WIZARDS, CAVALIERS, RAPTORS, CELTICS, PACERS, HAWKS, NETS, HEAT
4. What is the key value
corresponding to TREE-
MINIMUM(right child of root)?
5. What is the key value
corresponding to TREE-
PREDECESSOR(TREE-
MINIMUM(right child of root))?
11
II
Transcribed Image Text:4. What is the key value corresponding to TREE- MINIMUM(right child of root)? 5. What is the key value corresponding to TREE- PREDECESSOR(TREE- MINIMUM(right child of root))? 11 II
Expert Solution
steps

Step by step

Solved in 6 steps with 6 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.
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