Representing dynamic binary trees succinctly

We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in constant time and subtree size in O(lg n). In contrast to the linear update costs of previously proposed succinct representations, our representation supports updates in O(lg2n) amortized time.

• Type: Conference
• Year: 2001
• Where: SODA
• Authors: J. Ian Munro, Venkatesh Raman, Adam J. Storm
• Keywords: Algorithms, Basic Navigational Operations, Linear Update Costs, Representation Supports Updates, SODA 2001