You are given a binary search tree with unique integer keys. If you delete the root node, what will be the time complexity of finding its in$-$order successor?

Question $7$ options:

O$($n$)$

O$($logn$)$

O$($logn$)$ in a balanced BST$,$ O$($n$)$ in a skewed tree

O$(1)$