Which of the following is TRUE?

GATE · 2008 · IT

1. A.

   The cost of searching an AVL tree is θ (log n) but that of a binary search tree is O(n)

2. B.

   The cost of searching an AVL tree is θ (log n) but that of a complete binary tree is θ (n log n)

3. C.

   The cost of searching a binary search tree is O (log n ) but that of an AVL tree is θ(n)

4. D.

   The cost of searching an AVL tree is θ (n log n) but that of a binary search tree is O(n)

Attempted by 788 students.