GATE Computer Science (CS) 2012 Solved Paper

Question : 15 of 65

Marks: +1, -0

The worst case running time to search for an element in a balanced binary search tree with n2ⁿ elements is