Question: Q3 Q4 Question 1: (a) Explain AVL tree. (b) Draw the AVL tree; resulting from the insertion of an entry with key 58 into the
Question 1: (a) Explain AVL tree. (b) Draw the AVL tree; resulting from the insertion of an entry with key 58 into the following figure. TI db TA Question 2: (a) Explain (2, 4) tree. (b) Consider the sequence of keys (7,18,23,45,10,18,30,50,12,1,56,74). Draw the result of inserting entries with these keys (in the given order) into an initially empty (2, 4) tree. Question 3: (a) Explain Binary Search tree. (b) Insert into an empty binary search tree, entries with keys 32,42 25, 58, 48, 29, 10, 19 (in this order). Draw the tree after each insertion. Question 4: (a) Explain red-black tree. (b) Consider the sequence of keys (7, 18, 5, 16, 25, 30, and 80). Draw the result of inserting entries with these keys (in the given order) into an initially empty red-black tree
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
