$2$ Poir

In a Balanced Binary Search Tree, what is the worst case time complexity to search for an item?

$O(1)$

$O(logn)$

$O(2^n)$

$O(n)$

$O(nlogn)$

$O(n^2)$

$O(n^{2}logn)$

None of the above

$O(n^3)2$ Poir

In a Balanced Binary Search Tree, what is the worst case time complexity to search for an item?

$O(1)$

$O(logn)$

$O(2^n)$

$O(n)$

$O(nlogn)$

$O(n^2)$

$O(n^{2}logn)$

None of the above

$O(n^3)$