(5,16,22,45,2,10,18,30,50,12,1)
Consider the insertion of items with this set of keys, in the order given, into :
a. An initially empty (2,4) tree T’
b. An initially empty red black tree T’’
(5,16,22,45,2,10,18,30,50,12,1)
Consider the insertion of items with this set of keys, in the order given, into :
a. An initially empty (2,4) tree T’
b. An initially empty red black tree T’’