Binary Search Tree

Overview

A Binary Search Tree (BST) is a data structure that maintains sorted data in a way that allows for efficient insertion, deletion, and lookup operations.

Properties

• Each node has at most two children: left and right.
• The left subtree contains only nodes with values less than or equal to the parent node.
• The right subtree contains only nodes with values greater than the parent node.

Example

More Information

For more details on Binary Search Trees, visit this page.