How to prove that insert in binary search tree is minimum O(log n)?

Question

How to prove that insert will give give you correct BST in minimum O(log n) time?