Structure

A binary search tree is a node-based binary tree data structure.

For every node:

• The left subtree of a node contains only nodes with smaller keys.
• The right subtree of a node contains only nodes with larger keys.