Question 7 ... 


Questions on the following topics: 
Tree ADTs: Binary Search Tree, Balanced trees, 2-3-4 trees, heaps, etc. 


For example, 


Answer:
A.  (after inserting 8 into 2-3-4 tree)

root = [12|35|60]
leaf = [1|7|8]

Hint: 
We insert at leaf level. 
No overflow, so no split is required.


B.  (after inserting 42 into 2-3-4 tree)

root = [35]
leaf = [42|60]

Hint: 
We insert at leaf level.
At leaf, we split the overflow node [36,42,44,57], promote 42, two nodes [36] and [44,57].
After that, we split the overflow node [12,35,42,60], promote 35, two nodes [12] and [42,60] . 
Root node now is 35.