Category:Binary Search Tree: Difference between revisions

Revision as of 22:33, 19 September 2014

There is a tree item type with three components:
1. key is of generic type [math]\displaystyle{ \kappa }[/math]
2. left and right of type "pointer to tree item of type [math]\displaystyle{ \kappa }[/math]"
An object of the binary search tree type contains a pointer root of type "pointer to tree item of type [math]\displaystyle{ \kappa }[/math]"
The pointer root points to a well-formed binary search tree. In accordance with the definition of directed trees, "well-formed" means that, for any node, there is exactly one path from the root to that node.

The following 8 pages are in this category, out of 8 total.

@@ Line 1: / Line 1: @@
 == General Information ==
-'''Abstract Data Structure:''' [[Sorted Sequence]]
+===Abstract Data Structure:===
+[[Sorted Sequence]]
-'''Implementation Invariant:'''
+===Implementation Invariant:===
 # There is a tree item type with three components:
-## Key is of generic type K
+## '''''key''''' is of generic type <math>\kappa</math>
-## left and right of type "pointer to tree item of type K"
+## '''''left''''' and '''''right''''' of type "pointer to tree item of type <math>\kappa</math>"
-# An object of the binary search tree type contains a pointer root of type "pointer to tree item of type K"
+# An object of the binary search tree type contains a pointer '''''root''''' of type "pointer to tree item of type <math>\kappa</math>"
-# The pointer root points to a well-formed binary search tree. In accordance with the definition of [[directed trees]], "well-formed" means that, for any node, there is exactly one [[path]] from the root to that node.
+# The pointer '''''root''''' points to a well-formed binary search tree. In accordance with the definition of [[directed trees]], "well-formed" means that, for any node, there is exactly one [[path]] from the root to that node.