| | Question

Last Updated :
Discuss
Comments

Consider a segment tree built on an array of N elements. What is the minimum number of node updates required to rebuild the entire tree if the original array is reversed?

N

N - 1

2N - 1

N log N

This question is part of this quiz :

Top MCQs on Graph Data Strcuture with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy