a tree representing an adaptively refined mesh is potentially very unbalanced with a search complexity approaching OðnÞ in the number of leaf nodes, whereas binary search in the linear representation is always Oðlog2nÞ [4].
a tree representing an adaptively refined mesh is potentially very unbalanced with a search complexity approaching OðnÞ inthe number of leaf nodes, whereas binary search in the linear representation is always Oðlog2nÞ [4].