Binary Search Trees

Overview

A binary search tree is a data structure in programming used for searching through multiple elements quickly and efficiently.

How it works:

• Fast and efficient methods of insertion, deletion, and search
• Left child is always smaller than parent
• Right child is always larger than parents

Diagram

Learn More