NTA UGC NET Aug 2024 Paper-2
April 11, 2025NTA UGC NET Dec 2023 Paper-2
April 12, 2025NTA UGC NET Dec 2023 Paper-2
|
Question 31
|
Which of the following is TRUE?
|
The cost of searching an AVL tree is Θ(log n) but that of binary search is O(n)
|
|
|
The cost of searching an AVI, tree in Θ(log n) but that of complete binary tree is Θ(n log n)
|
|
|
The cost of searching a binary tree is 0(log n) but that ut AVL tree is Θ(n)
|
|
|
The cost of searching an AVL tree is Θ(n log n) but that of binary search tree is O(n)
|
Correct Answer: A