What is the worst$-$case time complexity of inserting a node into an unbalanced binary search tree with $\text{'}$n$\text{'}$ nodes?

Question $15$ options:

O$(1)$

O$($log n$)$

O$($n$)$

O$($n$^2)$