1

Complexity of the operation in the segment tree is equal to the O(logn) on the basis of this can we say that any segment tree is balanced?

1 Answers1

1

If "the operation" you're talking about consists of traversing a path from the root to some leaf, then yes, "having max height of O(log n)" sound like a good balance criteria, I would say even a definition :)

chill
  • 16,470
  • 2
  • 40
  • 44