Suppose you have a binary search tree with no right children. Which of the following explains how this tree may have ended up this way?

The first value added was the smallest, all remaining values were added in an arbitrary order.

The first value added was the largest, all remaining values were added in an arbitrary order.

The values were added to it in descending $($decreasing$)$ order.

This is not possible. A binary tree must have nodes with both right and left children.

The values were added to it in ascending $($increasing$)$ order.