Q$1\mathrm{.}2$

$1$ Point

The best$-$case number of key comparisons to insert a key into a Binary Search Tree that contains $n$ keys is $($mark all correct answers$)$:

$(logn)$

$(n)$

$(logn)$

$O(n)$

o$(1)$