Differences between version 2 and previous revision of BinaryTree.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 2 | Last edited on Monday, November 18, 2002 8:11:32 pm | by PerryLorier | Revert |
| Older page: | version 1 | Last edited on Monday, November 18, 2002 8:10:57 pm | by PerryLorier | Revert |
@@ -9,5 +9,5 @@
A Binary tree that you insert data into randomly should have about O(log n) complexity for insert/delete. See O(1) for more details.
Note, a BinaryTree will degrade into a LinkedList if you insert data into it in sorted order. Doh.
-There are optimisations on BinaryTree's such as RedBlackTree's, [BTree]'s etc..
.
+There are optimisations on BinaryTree's such as RedBlackTree's, [BTree]'s, [AVLTree]'s, SplayTree
's etc. Lots of fun for the entire family
.
