Binary Search Tree (BST)

Overview

A Binary Search Tree is a hierarchical data structure that stores elements in a way that allows efficient searching, insertion, and deletion. Each node has at most two children: a left child and a right child.

Key Properties

• The left subtree of a node contains only nodes with keys smaller than the node’s key.
• The right subtree contains only nodes with keys greater than the node’s key.
• Both left and right subtrees must also be binary search trees.

Learn more at Binary Search Tree – Wikipedia .