Q5

MCQ1 mark, −0.33

The worst case running time to search for an element in a balanced binary search tree with $n2^{n}$ elements is