Succinct data structure for dynamic trees with faster queries
share
Navarro and Sadakane [TALG 2014] gave a dynamic succinct data structure for storing an ordinal tree. The structure supports tree queries in either O( n/ n) or O( n) time, and insertion or deletion of a single node in O( n) time. In this paper we improve the result of Navarro and Sadakane by reducing the time complexities of some queries (e.g. degree and level_ancestor) from O( n) to O( n/ n).
READ FULL TEXT