What is the worst$-$case time complexity of inserting a node into a Binary Search Tree $($BST$)$ with n nodes?$$

$($n$)$

$($log n$)$

$(1)$

$($n log n$)$