ALWAYS REMEMBER: **BALANCED BINARY SEARCH TREE = AVL TREE
Note:** Binary Search Tree and Balanced Binary Search Tree is 2 different things.

*All Binary Search Tree need not be Balanced however the vice versa is TRUE.*
The Gateway to Computer Science Excellence

+33 votes

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

- $\Theta(n\log n)$
- $\Theta(n2^n)$
- $\Theta(n)$
- $\Theta(\log n)$

+68 votes

Best answer

52,345 questions

60,497 answers

201,858 comments

95,314 users