Q$1\mathrm{.}1$

$1$ Point

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

$(n)$

$O(logn)$

$O(1)$

$O(n)$

$(n)$

$(logn)$

$(logn)$

Last saved on Feb o$6$ at $12$:$56$ PM