Binary Search Tree

A Binary Search Tree (BST) is a data structure where each node has at most two children, referred to as the left and right child.

Key Properties

• The left subtree contains only nodes with keys less than the parent node.
• The right subtree contains only nodes with keys greater than the parent node.
• Both the left and right subtrees are also binary search trees.
• No duplicate nodes are allowed.

Visual Example

Learn More

Binary Search Tree - Wikipedia