Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
Segment | Trees and Binary Indexed Trees Quiz CIP | Question 10
Last Updated :
Discuss
Comments
What is the time complexity of querying a range in a binary indexed tree?
O(1)
O(log n)
O(n log n)
O(n)
This question is part of this quiz :
Segment Trees and Binary Indexed Trees Quiz CIPTags:
Share your thoughts in the comments
GeeksforGeeks