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

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

See similar textbooks

Similar questions

Do you have any idea what makes minimum spanning trees so special? The c language is taken for granted.
implementation of AVL trees that would include insertion deletion functions as well as rotations. code in c++
09. Code for Lowest common ancestor(LCA) in binary tree in java?
What distinguishes a binary search tree from a binary tree?
a. Construct a binary tree using low priority operator from the expression given below: a/b+c*(d-e) b. Print elements of the binary tree constructed in step (a) using preorder and postorder binary tree traversal techniques. SUBJECT = DISCRETE STRUCTURES
Coding in c for binary tree file system which has inorder, postorder and preorder traversal.File system that has 4 levels.
Which is superior, the upgraded binary search tree or the standard binary tree?
Explain binary tree and its representation. 2.
10. Draw the expression tree with this postfix form (% is modulo operation) wpy/+ma+xb%*+ h W m k Binary Tree H n
Python data structures: Implement following binary-search tree functions: - search(key) - insert(key) - print_in_order(): prints the keys in the binary tree in ascending order.