Binary Search Trees

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

A type of binary tree where the left child always contains a value less than the parent and the right child always contains a value greater than the parent.