## You are here

Homesearch tree

## Primary tabs

# search tree

A *search tree* is a tree where every subtree of a node has keys
less than any other subtree of the node to its right. The keys in a node are
conceptually between subtrees and are greater than any keys in subtrees to its
left and less than any keys in subtrees to its right.

A search might visit nodes in the tree to locate some information. At the outset of the search one has a given key and seeks to find the node in the tree having that key. As the nodes are visited a comparison of the node’s key to the given key is made and a decision to go to either the left subtree or the right subtree is made. Knowing that all keys to the left (right) are smaller (larger) makes the search easy to carry out.

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

68P10*no label found*68P05

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections