3. Binary Search Tree and AVL Tree This problem will compare the difference between an ordinary BST (henceforthreferred 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 aregiven. 1 tree will be a BST and the other is an AVL treeAfter completing all insertions, answer the questions below based on the resultingBST and AVL tree. There are 8 questions so you should have a total of 16 answers (1answer 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 nodeInsert the following key values in this sequence for both trees: BUCKS, WIZARDS,CAVALIERS, RAPTORS, CELTICS, PACERS, HAWKS, NETS, HEAT 6. Perform TREE-SEARCH(root,"BUCKS"). How many node keyswere compared with parametervalue BUCKS?7. Perform TREE-SEARCH(root,"HEAT"). Which node key was thelast one to be compared withparameter value HEAT?8. How many nodes would have tobe added to the tree for it tobecome a full binary tree?III11

6) When TREE-SEARCH(root,"BUCKS") is called, the search starts from root which is BUCKS, the target…

6. Perform TREE-SEARCH(root, "BUCKS"). How many node keys were compared with parameter value BUCKS? 7. Perform TREE-SEARCH(root, "HEAT"). Which node key was the last one to be compared with parameter value HEAT? 8. How many nodes would have to be added to the tree for it to become a full binary tree?

6. Perform TREE-SEARCH(root, "BUCKS"). How many node keys were compared with parameter value BUCKS? 7. Perform TREE-SEARCH(root, "HEAT"). Which node key was the last one to be compared with parameter value HEAT? 8. How many nodes would have to be added to the tree for it to become a full binary tree?

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

How do the advantages of a binary search tree compare to those of other data structures, such as a linked list or an array?
09. Code for Lowest common ancestor(LCA) in binary tree in java?
What distinguishes a binary search tree from a binary tree?
ANNOTATED PARSE TREE 5*6+7
6. Draw the diagram of the binary tree corresponding to the following algebraic expression: A* (B+C*D) + (E/F) *K/G*H
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.
Which is more advantageous: a standard binary tree or an advanced binary search tree?
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.
What is a Binary Search Tree, and how does it work?