$4$

$2$ points

Suppose you start with a standard binary search tree that is initially empty. Suppose you then add n ordered items into the tree. What would be the big O to find an element in this tree?

$O(logn)$

$O(n^2)$

$O(n)$

$O(nlogn)$