binary search tree

2. A data structure where each node has at most two children, with smaller values on the left and larger values on the right.

Inserting 5, 3, and 8 into the binary search tree keeps it balanced and easy to search.

3. A tree in which every left subtree holds only smaller keys and every right subtree holds only larger keys.

The binary search tree property guarantees that an in-order traversal lists the keys in sorted order.

4. A recursive structure used for fast lookup, insertion, and deletion of ordered data.

Deleting a node with two children from a binary search tree requires finding its in-order successor.