Problem 1 Draw the following binary tree. Where only the key is shown (disregard 2xDOB or 3xMOB if it is same as one of the numbers): 35, 20, 23, 15, 40, 38, 2xDOB, 45, 33, 48, 3xMOB, 13, 46, 17, 39, 16, 21 1- Is the tree balanced? 2-Show the inOder, pre-Order and post-Order traversal of the tree. 3-delete node 20 using the largest on the left. If you are given a reference to node 20, what would be the java code to perform the deletion? 4-delete 2xDOB using the smallest on the right. If you are given a reference to node 2xDOB, what would be the java code to perform the deletion?

Problem 1 Draw the following binary tree. Where only the key is shown (disregard 2xDOB or 3xMOB if it is same as one of the numbers): 35, 20, 23, 15, 40, 38, 2xDOB, 45, 33, 48, 3xMOB, 13, 46, 17, 39, 16, 21 1- Is the tree balanced? 2-Show the inOder, pre-Order and post-Order traversal of the tree. 3-delete node 20 using the largest on the left. If you are given a reference to node 20, what would be the java code to perform the deletion? 4-delete 2xDOB using the smallest on the right. If you are given a reference to node 2xDOB, what would be the java code to perform the deletion?

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

For questions 4 – 6, indicate for each of the following statements if it is true or false and explain why.4. The subtree of the root of a red-black tree is always itself a red-black tree.5. The sibling of a null child reference in a red-black tree is either another null child reference or ared node.6. The worst case time complexity of the insert operation into an AVL tree is O(log n), where n isthe number of nodes in the tree.
Hey, we werer asked what tree does Preorder:6,8,4,2,10,11,7 gives. In our lecture Preorder was defined as : Preorder T := r, Tv1, Tv2,...,TVp Tv standing for the subtrees. My problem now is that with the root 6, the left subtree would be 8,4,2 wich does not make senese since 8 > 6. where am i going wrong?
Draw the BST constructed by inserting the values [53, 25, 11, 63, 4, 88,59, 3, 15, 82, 92, 27, 55, 14] in the order shown, into an initially empty tree. 2. Using the tree traversal algorithms and the BST from above, show theoutput sequence for a (a) Preorder traversal(b) Postorder traversal 3. Delete the node with value 25 and draw the resultant tree.(a) Use two methods to delete the node with value 25 and draw the resul-tant tree. also describe both methods that you have used
Consider a B-Tree with order as 3. Which of the following will be the correct B-tree for the given key value sequence? 12, 13, 7, 16, 19, 20, 25, 3, 6
Consider the values 19, 10, 4, 30, 55, 24, 9, 13, 11 and 22: Draw the 2-3-4 tree that results from inserting these values in that order into an initially empty 2-3-4 tree. Show your workings.
Given the following key sequence (6,22,9,14,13,1,8) build the dynamic binary search tree WITHOUT BALANCING IT. How many probes (i.e., comparisons) does it take to determine that key 100 is not in the tree? (In this study case, the root is 6; the next element 22 > 6, so it goes to the right, etc). DEPTH counting starts at 1 at the root
Draw a binary tree forthegiven inorder and post order traversals below:In order: 1,2,3,8,10,7,5,13,9,12,6,11,4Post order: 8,3,10,2,1,7,6,12,11,9,13,4,5
Use the given AVL tree to answer each of the following questions: (a) Which is the deepest unbalanced node after inserting key 5, but before re-balancing, and what is its balance factor? (b) After the insertion, perform all the necessary rotations required to re-balance the tree, and after each rotation, state the type of rotation done and list the keys of the resulting tree in the form: After Left/Right rotation: e1, e2, e3, ...., en. (breadth-first order)
I am loosing my mind: I am supposed to insert the following values in that order in an empty binary tree: 6,4,10,19,7,3,2,13,14,5,11 After that i geth the question is that a full binary tree? If no how could u change the input order to get a full binary tree. the problem is i think i cant get a binary tree: there are simply not enough nubers to get 2 children for every inner knot. Am i wrong?
. Draw the BST constructed by inserting the values [53, 25, 11, 63, 4, 88,59, 3, 15, 82, 92, 27, 55, 14] in the order shown, into an initially emptytree. 2. Using the tree traversal algorithms and the BST from (1) above, show theoutput sequence for a (a) Preorder traversal(b) Postorder traversal3. Delete the node with value 25 and draw the resultant tree.(a) Use two methods to delete the node with value 25 and draw the resul-tant tree. (b) Briefly describe both methods that you have used.
Exercise 4 Consider the B-tree which is a result of inserting 15,14,1,2,13,12,3,4,11,10,5,6,9, (in that order) for t = 2. (a) Draw the trees before and after adding 9. (b) Draw the final tree after adding all numbers. (c) Next draw the tree after removing 14.
Consider the sequence of keys (5,16,22,45,2,10,18,30,50,12,1, 77, 66, 55). Draw the result of inserting entries with these keys (in the given order) into an initially empty red-black tree.