Binary Search Trees
From
(Difference between revisions)
| Line 1: | Line 1: | ||
| - | An important and frequently used | + | An important and frequently used specialization of a binary tree is a '''Binary Search Tree'''. A |
binary search tree contains data that is ''comparable'', for example numbers or text, and has the | binary search tree contains data that is ''comparable'', for example numbers or text, and has the | ||
following property: | following property: | ||
Revision as of 15:46, 28 March 2009
An important and frequently used specialization of a binary tree is a Binary Search Tree. A binary search tree contains data that is comparable, for example numbers or text, and has the following property:
Binary Search Tree Property: If N is a node in the tree, and N contains data D, then all nodes in the left subtree of N contain data that is less than or equal to D and all nodes in the right subtree of N contain data that is greater than D.
