Question 10112 – GATE 1996
April 26, 2024Question 5328 – UGC NET CS 2013 Dec-paper-2
April 26, 2024Question 8808 – Data-Structures
The worst case running time to search for an element in a balanced binary search tree with n2n elements is
Correct Answer: C
Question 20 Explanation:
→ Worst case running time to search for an element in a balanced binary search tree of ‘n’ elements is (log n).
→ No of elements = n.2n then search time = (log n.2n)
= (log n + log 2n)
= (log n + n log 2)
= O(n)
→ No of elements = n.2n then search time = (log n.2n)
= (log n + log 2n)
= (log n + n log 2)
= O(n)
Θ (n log n)
Θ (n2n)
Θ (n)
Θ (log n)
Subscribe
Login
0 Comments