Which of the following data structures can handle updates and queries in log(n) time on an array?
[ ] Linked list [ ] Stack
[X] Segment Tree [ ] Queue
Explanation: Correct answer is Segment Tree. Please refer to this wikipedia article to read all the details of Segment Trees.