Binary Search Tree

Overview

The binary search tree (BST) is a node-based binary tree data structure.

Key Features

• Efficient searching, insertion, and deletion
• Left child < parent < right child rule
• Used in many CS400 algorithms

Learn more on Wikipedia.