Data Structure
Java
Python
HTML
Interview Preparation
- Tutorials
- Courses
- Tracks
GATE | IT | 2008 | Data Structures | Tree | Question 12
Last Updated :
Discuss
Comments
Which of the following is TRUE?
The cost of searching an AVL tree is θ (log n) but that of a binary search tree is O(n)
The cost of searching an AVL tree is θ (log n) but that of a complete binary tree is θ (n log n)
The cost of searching a binary search tree is O (log n ) but that of an AVL tree is θ(n)
The cost of searching an AVL tree is θ (n log n) but that of a binary search tree is O(n)
Share your thoughts in the comments
GeeksforGeeks