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

True or False: 1. Two binary trees T and T' are said to be copies if both these trees have the same structure 2. For a B tree the root node has at least two children if it is not a terminal (leaf) node 3. A trie is very commonly used to store a dictionary 4. B-trees are often used to index the data and provide fast access
BST - Binary Search Tree - implement a BSTNode ADT with a data attribute and two pointer attributes, one for the left child and the other for the right child. Implement the usual getters/setters for these attributes -implement a BST as a link-based ADT whose data will be Dollar objects - the data will be inserted based on the actual money value of your Dollar objects as a combination of the whole value and fractional value attributes. - BST, implement the four traversal methods as well as methods for the usual search, insert, delete, print, count, isEmpty, empty operations and any other needed. - BST - Binary Search Tree - implement a BSTNode ADT with a data attribute and two-pointer attributes, one for the left child and the other for the right child. Implement the usual getters/setters for these attributes -implement a BST as a link-based ADT whose data will be Dollar objects - the data will be inserted based on the actual money value of your Dollar objects as a combination of the…
Think about the BiNode basic data structure, which contains references to two other nodes. Both a binary tree (where node1 is the left node and node2 is the right node) and a doubly linked list may be represented by the data structure BiNode (where node1 is the previous node and node2 is the next node). Implement a technique to transform a doubly linked list from a binary search tree (implemented using BiNode). Keep the values in the proper sequence, and carry out the procedure as directed (that is, on the original data structure).
Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follow: You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree. Header file typedef char ElemType; typedef struct node//define the type of binary tree node { }BTnode; Source file #include <stdio.h> #include <stdlib.h> #include "tree.h" BTnode * createTree()//create the binary tree，return the root { BTnode *tnode;// tnode is the root char elem; ;//input the character //if the input is a space，set the pointer as NULL Else// if the input is not a space，generate the binary node and create its left sub-tree and right…
Given the following struct that represents a binary tree: struct Node { int key: Node "parent; Node "left; Node "right; Nodelint k) : key(k), parent(nullptr), left(nullptr), right(nullptr) (I: 1: Write a recursive function that prints out the nodes in a tree stored using the above structure in order to cout. The function prints the depth (root depth is at 0) and key of that node separated by a colon (Example "O: 10\n" for root with key 10). Your function CAN NOT create any local variables and can only use what is passed to the function. Use the below function signature (NOTE: this is not a class method). void inorderAndDepth(Node "node, int depth)
in c++ Suppose the following values are inserted into a binary tree, in the order given: 12, 7, 9, 10, 22, 24, 30, 18, 3, 14, 20 Draw a diagram of the resulting binary tree. How would the values in the tree you sketched for part a be displayed in an in-order traversal? How would the values in the tree you sketched for part a be displayed in a preorder traversal? How would the values in the tree you sketched for part a be displayed in a post order traversal?
2. Perform the traversals for the above tree: a. reverse postorder: b. preorder traversal: c. Give the array representation of the binary tree above.
A) Draw the BST after the insertion of keys: 6, 45, 32, 98, 55, and 69, in this order B) Use AVL to balance the tree that you created above PLEASE HELP WITH PARTS A AND B!!!
Given a set of 9 letters { H, K, S, P, A, E, I, 0, U }, answer the following: a) Draw a binary search tree which is also a complete binary tree, constructed with the letters of the given set above (based on alphabetical ordering). NO steps required. b) Determine and list the sequence of elements obtained by post-order traversing the binary search tree constructed above. NO steps required. c) A new letter N is first inserted into the binary search tree determined above, followed by inserting another letter M. The original letter K is then removed from the binary search tree. Draw the updated binary search tree after these insertions and removal. NO steps required. d) Find the average search length of the updated binary search tree in step c) with 2 decimal places, assume all nodes in the tree have same probability in searching. Clearly show the steps of your calculation.
Given a set of 9 letters { H, K, S, P, A, E, I, O, U }, answer the following: a) Draw a binary search tree which is also a complete binary tree, constructed with the letters of the given set above (based on alphabetical ordering). NO steps required.b) Determine and list the sequence of elements obtained by post-order traversing the binary search tree constructed above. NO steps required.c) A new letter N is first inserted into the binary search tree determined above, followed by inserting another letter M. The original letter K is then removed from the binary search tree. Draw the updated binary search tree after these insertions and removal. NO steps required. d) Find the average search length of the updated binary search tree in step c) with 2 decimal places, assume all nodes in the tree have same probability in searching. Clearly show the steps of your calculation.
1) Create a binary tree for the sequence of letters: D A T S R U C E I M P O N and another for letters: 2) Create all binary trees templates (structures) with a size of 4 (identify how many are distinct) 3) Create a binary tree for the sequence of letters: S E A R C H B I N Y T U L D. Draw the tree. Search for D (show on the tree which nodes were visited). Search for M (show on the tree which nodes were visited). 4)Create a binary tree for the sequence of letters: D E L T K Y N S A R C H. Draw the tree. Delete the key A (show the tree obtained). Delete the key L (show the tree obtained). Delete the key E (show the tree obtained).
Binary Search Tree Empirical and Theoretical ResultsPart 1: we need to define a binary search tree data structure. Also, we need to implement the following functions:1. Insert Sorted: BSTREE insert(BSTREE root, int num): root points to a node in a binary search tree; num is a number to be inserted in the tree rooted at “root”. This function returns the root of the modified tree.2. Print Elements: void inorder traversal(BSTREE root, FILE *fp): root points to a node in a binary search tree. This function does not return anything, but prints out, to the file specified, the nodes in the tree rooted at “root” by performing an inorder traversal.