title: Time complexity of deletion in binary search tree
body: <p>Assume the height of the BST is h.
  If we want to delete a node with two children, then what would be the time complexity of the process.</p>
  
  <p>I know that in a normal binary tree, the time complexity for deletion is O(h); O(n) worst case and O(logn) best case. But since we are replacing the key of the deleting node by the minimum node of right sub tree of it, it will take more time to find the minimum key.</p>
  
  <p>So does anybody know how to explain the time complexity in this situation?</p>