$8.$ In a binary search tree $($BST$),$ what is the time complexity of inserting an element in the average case? In a binary search tree $($BST$),$ what is the time complexity of inserting an element in the average case? Pick ONE option $0(1)$ O$($n$)0($log n$)$ O$($n log n$)$ Selection