Binary Search Tree (BST)

Overview

A Binary Search Tree is a data structure that allows efficient searching, insertion, and deletion.

Properties

Left subtree values are smaller than the root.
Right subtree values are larger than the root.
Each subtree is also a BST.

Binary Search Tree Diagram

Learn more on Wikipedia.