All levels filled except last.

Binary tree with added nodes.

In computer science, a binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.

(mathematics, computing) A binary tree in which each node has exactly two or zero children.

In computer science, a self-balancing binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.

In computing, a threaded binary tree is a binary tree variant that facilitates traversal in a particular order.

A binary expression tree is a specific kind of a binary tree used to represent expressions.

In computer science, an optimal binary search tree (Optimal BST), sometimes called a weight-balanced binary tree, is a binary search tree which provides the smallest possible search time (or expected search time) for a given sequence of accesses (or access probabilities).