What is the worst complexity of searching for a number in a Binary Search Tree if the tree is not balanced?
a. O(n)
b. O(1)
c. O(logn)
d. O(n logn)
a. O(n)
b. O(1)
c. O(logn)
d. O(n logn)