Binary Search Tree

A Binary Search Tree (BST) is a type of rooted binary tree data structure that is organized from left to right, least to greatest

Rules

1. The root's left child and all of its descendants have lower values than root's value
2. The right child, and all its descendants have higher values than root's value
3. Left and right subtrees must also be Binary Search Trees

Operations

• Insertion
• Deletion
• Search

Example



Link to Wikipedia page