Binary Search Trees

Binary Search Tree Rotation

A Binary Search Tree (BST) is a fundamental tree structure in computer science.

Key Properties

Left subtree has smaller values than the node's value
Right subtree has bigger values than the node's value
Both left and right subtrees must be binary search trees.

Example Diagram

Binary Search Tree Diagram

Learn More

For more details, visit the Wikipedia page on Binary Search Trees.