Anonymous user
Talk:AVL tree/Java: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 115:
For AVL Trees, iteration is achieved through the use of parent references. For B+ Trees, the key is stored twice and the leaves form a double linked list (and B+ Trees have no parent references). This is all rather awkward compared to the elegant solution that AVL Trees offer.
Using the above definition of nodes, it is possible to produce all the classes in [http://nncnannara.net/Html/English/Java/persist/index.html Applied Calculus]. Note that unordered collections such as [http://nncnannara.net/Html/English/Java/persist/Table.html Table] and [http://nncnannara.net/Html/English/Java/persist/Map.html Map] are possible. This is because of a type of hashing known as Binary Hashing, where hash tables are implemented using AVL Trees. That is, Unordered Calculus has been derived from Ordered Calculus using Binary Hashing.[[User:NNcNannara|NNcNannara]] ([[User talk:NNcNannara|talk]]) 11:06, 11 March 2017 (UTC)
| |||