Are you sure you're getting this? Click the correct answer from the options.
Which of the following statements about querying a Fenwick Tree is correct?
Click the option that best answers the question.
- Querying a Fenwick Tree has a time complexity of O(log n), where n is the number of elements in the Fenwick tree.
- Querying a Fenwick Tree has a time complexity of O(n), where n is the number of elements in the Fenwick tree.
- Querying a Fenwick Tree has a time complexity of O(1), regardless of the number of elements in the Fenwick tree.
- Querying a Fenwick Tree is not possible.