In a balanced binary search tree with elements, what is the worst case time complexity of reporting all elements in range ? Assume that the number of reported elements is .
- (A)
- (B)
- (C)
- (D)
GATE 2020 CS Q.41: official answer
Official answer
Official answer: BSource: Official answer key, GATE 2020 CS (IIT Delhi)
From the GATE 2020 CS paper. Every question of this paper · Download the full paper · All 26 Trees & heaps questions, with notes
More Trees & heaps questions
- GATE 2018 CS Q.20 · NAT · 1 markThe postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is…
- GATE 2018 CS Q.46 · NAT · 2 marksThe number of possible min-heaps containing each value from 1, 2, 3, 4, 5, 6, 7 exactly once is.
- GATE 2026 CS1 Q.23 · MSQ · 1 markLet n be an odd number greater than 100. Consider a binary minheap with n elements stored in an array P…
- GATE 2026 CS1 Q.33 · NAT · 1 markThe height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree.