Try this exercise. Click the correct answer from the options.
What is the time complexity of updating a Fenwick Tree?
Click the option that best answers the question.
- O(log n)
- O(1)
- O(n)
- O(n log n)
Back to course sections
Mark As Completed Discussion