Which of the following is TRUE?
(A)
The cost of searching an AVL tree is θ (log n) but that of a binary search tree is O(n)
(B)
The cost of searching an AVL tree is θ (log n) but that of a complete binary tree is θ (n log n)
(C)
The cost of searching a binary search tree is O (log n ) but that of an AVL tree is θ(n)
(D)
The cost of searching an AVL tree is θ (n log n) but that of a binary search tree is O(n)
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!