# Insert into a binary tree

Which of the following represents the time complexity of inserting an element into a binary search tree of $$n$$ nodes, with the tightest upper bound?

×