Some trees are self-balancing (AVL, Red-Black, Weak Heaps...). A pure binary tree that does not self-balance is a rarity in common usage where sorted distributions are likely to occur anyway. Feb 6 '07 #7 This thread has been closed and replies have been disabled. Please start a ...
such as the ideas that computation is a step-by-step process, using a small number of basic primitives to build up programs, and the concept of memory variables as places where numbers are stored, in which the address or name of the variable is distinct from the number it contains. There...
Actually, I would dump TreeMap altogether since 3000 lines of code is a bit bulkier than you probably need and just write a clean AVL tree implementation with the methods you need. The basic AVL logic is just a few hundred lines of code in any language then add ...