Binary Search Trees

Home > Computer Science > Algorithms and data structures > Trees > Binary Search Trees

A binary tree data structure where the left sub-tree of a node contains only nodes with keys less than the node’s key and the right sub-tree of a node contains only nodes with keys greater than the node’s key.