Worst time complexity

what is the worst case time to complete a query in segment tree??

Hey @govilayush
The worst case for update query is O(logn) in segment trees.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.