Binary search tree…PROOF that we can't insert O(1)

Question

Proof that there is not any binary search tree that can insert item for O(1) ( even amortized ).Please give good explanation