Category:Binary Search Tree: Difference between revisions

From Algowiki
Jump to navigation Jump to search
(Created page with "== General Information == '''Abstract Data Structure:''' Sorted Sequence '''Implementation Invariant:''' # There is a tree item type with three components: ## Key is of...")
 
(Blanked the page)
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
== General Information ==
'''Abstract Data Structure:''' [[Sorted Sequence]]


'''Implementation Invariant:'''
# There is a tree item type with three components:
## Key is of generic type K
## left and right 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 K"
# 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.

Latest revision as of 22:35, 19 September 2014

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Category:Binary_Search_Tree&oldid=219"