guibas and sedgewick" dichromatic framework for balanced trees,proceedings of the nineteenth annual ieee symposium on foundations of computer science ( ) - hibbard"some combinatorial properties of certain trees with applications to searching and sorting,journal of the acm ( ) - jonassen and knuth" trivial algorithm whose analysis isn' ,journal of computer and system sciences ( ) - karltons fullerr scroggsand kaehler"performance of height balanced trees,communications of the acm ( ) - knuththe art of computer programmingvol fundamental algorithms ed addison-wesleyreadingmass knuththe art of computer programmingvol sorting and searching ed addisonwesleyreadingmass melhorn" partial analysis of height-balanced trees under random insertions and deletions,siam journal of computing ( ) - melhorndata structures and algorithms sorting and searchingspringer-verlagberlin nievergelt and reingold"binary search trees of bounded balance,siam journal on computing ( ) - perlis and thornton"symbol manipulation in threaded lists,communications of the acm ( ) - sen and tarjan"deletion without rebalancing in balanced binary trees,proceedings of the twentieth symposium on discrete algorithms ( ) - sleator and tarjan"self-adjusting binary search trees,journal of the acm ( ) - sleatorr tarjanand thurston"rotation distancetriangulationsand hyperbolic geometry,journal of the ams ( ) - tarjan"sequential access in splay trees takes linear time,combinatorica ( ) - yao"on random - trees,acta informatica ( ) -