propagating sequence of fusions in ( , tree(aremoval of which causes an underflow(bfusionwhich causes another underflow(csecond fusion operationwhich causes the root to be removed(dfinal tree performance of ( , trees table summarizes the running times of the main operations of dictionary realized with ( , tree the time complexity analysis is based on the followingthe height of ( , tree storing entries is (logn)by proposition splittransferor fusion operation takes ( time searchinsertionor removal of an entry visits (lognnodes table performance of an -entry dictionary realized by ( , treewhere denotes the size of the