Anonymous user
Talk:AVL tree/Java: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 5:
The Java implementation of AVL Trees is a bit different to the C# version in that references to references are not available. This means that functions like RotateLeft and RotateRight return the new node rather than the function updating the reference for you. It is only a cosmetic change to the code. [[User:NNcNannara|NNcNannara]] ([[User talk:NNcNannara|talk]]) 11:25, 16 July 2016 (UTC)
AVL on Disk can be implemented in Java (i.e. AVL Databases). There are 12 databases in [http://nncnannara.net/Html/English/Java/persist/index.html|Applied Calculus]. Strangely enough, all 12 databases use the same basic node type on disk. The definition of that node type is shown below.
<lang Java>
| |||