Binary Search Trees

From

(Difference between revisions)
Jump to: navigation, search
Line 6: Line 6:
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'''.
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'''.
</blockquote>
</blockquote>
 +
== Searching for an Element in a Binary Search Tree ==
 +
 +
== Inserting an Element into a Binary Search Tree ==
 +
 +
== Removing an Element from a Binary Search Tree ==

Revision as of 15:50, 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.

Searching for an Element in a Binary Search Tree

Inserting an Element into a Binary Search Tree

Removing an Element from a Binary Search Tree

Personal tools
MediaWiki Appliance - Powered by TurnKey Linux