Search Trees (1-Dimensional)

• is a tree data structure used for locating specific keys from within a set
• in order for a tree to function as a search tree, the key for each node must be greater than any keys in subtrees on the left, and less than any keys in subtrees on the right

Search Tree Types

• Binary Search Tree (BST) (2 Way Tree)
• M-Way Search Tree (MST)
• Self-Balancing Search Trees