Sciweavers

Share
SODA
2001
ACM

Representing dynamic binary trees succinctly

11 years 3 months ago
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.
J. Ian Munro, Venkatesh Raman, Adam J. Storm
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where SODA
Authors J. Ian Munro, Venkatesh Raman, Adam J. Storm
Comments (0)
books