# Minimum in a Binary Tree

image

Suppose we implement an algorithm to find the minimum element in a binary search tree with $$n$$ nodes. Which of the following is a conceivable complexity for the algorithm?

×