Binary search tree
a.k.a. BST
A binary tree with a constraint on each node where that node's value is greater than or equal to every node value from the left subtree and less than every node value from the right subtree.
A binary tree with a constraint on each node where that node's value is greater than or equal to every node value from the left subtree and less than every node value from the right subtree.