Question $8$

$\frac{0}{1}pts$

Identify the best case runtime complexity of an

algorithm that efficiently inserts a new node into a

Red$-$Black tree.

Correct Answer

none of these

You Answered

$O(nlogn)$

$O(2^n)$

$O(n)$

$O(n^2)$