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 :)
Can we say that any segment tree is balanced?
-
21-09-2022 - |
题
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?
解决方案
不隶属于 StackOverflow