GATE 2007
April 5, 2025GATE 2008-IT
April 5, 2025GATE 2008-IT
| Question 12 |
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) |
Question 12 Explanation:
Complexity of AVL tree is O(logn) because it is a balanced tree, in Worst case binary search tree complexity is O(n).
Correct Answer: A
Question 12 Explanation:
Complexity of AVL tree is O(logn) because it is a balanced tree, in Worst case binary search tree complexity is O(n).
Subscribe
Login
0 Comments