Differences between current version and revision by previous author of BinaryTree.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 3 | Last edited on Wednesday, October 8, 2003 7:32:58 pm | by StuartYeates | |
| Older page: | version 2 | Last edited on Monday, November 18, 2002 8:11:32 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, [AVLTree]'s, SplayTree's etc. Lots of fun for the entire family.
+There are specialisations
on BinaryTree's such as RedBlackTree's, [BTree]'s, [AVLTree]'s, SplayTree's etc. Lots of fun for the entire family.
