Which of the following is TRUE ?
1
The cost of searching an AVL tree is θ (log n) but that of binary search is 0(n)
2
The cost of searching an AVL tree in θ (log n) but that of complete binary tree is θ (n log n)
3
The cost of searching a binary tree is 0 (log n) but that of AVL tree is θ (n)
4
The cost of searching an AVL tree is θ (n log n) but that of binary search tree is θ (n)