Draw a 2-4 tree that results from adding the following elements into an initially empty tree:
34 45 3 87 65 32 1 12 17
Answer)
2-4 Tree:
Insert 34
Insert 45
Insert 3
Insert 87, the node becomes 4 key so split in the middle.
Middle value 34 is created as a new node and split 3 and 45,87
Insert 65, which is greater than 34 so insert at right child.
Insert 32, which is less than 34 so insert at the left of 34.
Insert 1, which is less than 34 so insert at the left of 34.
Insert 12, which is less than 34 so insert at the left of 34. But the node becomes 4 key so split in the middle.
Middle value 3 is move to upper leyar and split 1 and 12,32
Insert 17, which is graiter than 3 and less than 34 so insert at middle node.
Draw a 2-4 tree that results from adding the following elements into an initially empty tree:...
Draw the binary search tree that results from starting with an empty tree and a. adding 50 72 96 94 26 12 11 9 2 10 25 51 16 17 95 b. adding 95 17 16 51 25 10 2 9 11 12 26 94 96 72 50 c. adding 10 72 96 94 85 78 80 9 5 3 1 15 18 37 47 d. adding 50 72 96 94 26 12 11 9 2 10, then removing 2...
Draw an AVL tree (initially empty) at each step when inserting the following numbers in order: 1; 2; 5; 4; 6; 3; 10; 9; 7; 8 Now, draw the above AVL tree at each step when deleting the following numbers in order (assuming that the substitution on deleting a node is done by replacing it with the minimum in the right subtree): 4; 5; 6
C D E F only please
Draw the binary search tree that results from starting with an empty tree and a. adding 50 72 96 94 26 12 11 9 2 10 25 51 16 17 95 b. adding 95 17 16 51 25 10 2 9 11 12 26 94 96 72 50 c. adding 10 72 96 94 85 78 80 9 5 3 1 15 18 37 47 d. adding 50 72 96 94 26 12 11...
answer number 7
5. Draw the binary search tree that would result from inserting the following numbers into an initially empty tree in the order given: 45, 37, 62, 67, 49, 51, 16, 8, 73, 71, 64, 65 6. Given the tree created in problem 5, draw the tree that would result if you deleted the 37 from the tree? 7. Given the tree created in problem 5, draw the tree that would result if you deleted the 62 from...
1- Insert in the given order the following values into an intially empty 2-3-4 tree: 100, 200, 300, 400, 500, 600, 700, 110, 120, 130, 800, 750, 690. Show how the tree evolves after each value is inserted. In other words, draw a picture of the tree after each insertion. 2- Insert the same sequence as above into an initially empty red-black tree. Again draw a picture of the tree after each insertion, and indicate which rotations and/or color flips...
1. Suppose we start with an empty B-tree and keys arrive in the following order. – 1, 12, 8, 2, 25, 6, 14, 28, 17, 7, 52, 16, 48, 68, 3, 26, 29, 53, 55, 45 – Build a B-tree of order 5 – Hints • 17: insert/split/promote • 68: insert/split/promote • 3: insert/split/promote • 45:insert/split/promote 2. Suppose we insert the keys {1,2,3, …, n} into an empty B-tree with degree 5, how many nodes does the final B-tree have?
5. Heap, 5pts] The following elements are inserted into an empty Max-Heap in the fol- la-FHea lowing order: 2, 3. 1, 4, 6. 12, 15, 22, 11, 5 Draw the resulting heap (use the logical (tree) representation)
Question 46 2 pts Which of the following is incorrect about a red-black tree? Group of answer choices a. The leaves are always red b. A red-black tree is equivalent to a 2-4 tree c. A red node must have a black parent d. Every path from the root to the leaves must have the same number of red nodes e. a and d Flag this Question Question 47 2 pts Given the following maxheap, assuming heap entries start at...
Draw a maximally balanced binary search tree that can be produced from the elements: 1, 2, 3, 4, 5, 6, 7, 8, 9. Hint: a maximally balanced binary search tree minimises the average depth of its elements.
(e) Consider an initially empty max-heap, where the following keys are to be inserted one at a time: 11, 19, 23, 12, 13, 17, 13, 14, 18, and 33. Draw the tree that results after building this max-heap. (f) Is it possible to find the maximum in a min-heap in O(log n) time? Justify. Important Notes: • For part (e) of this problem, you must draw the min (or max) heaps using the appropriate graphics tools at your convenience.