Abstract
The degree distribution of an ordered tree T with n nodes is n→=(n0,…,nn−1), where ni is the number of nodes in T with i children. Let N(n→) be the number of trees with degree distribution n→. We give a data structure that stores an ordered tree T with n nodes and degree distribution n→ using logN(n→)+O(n/logtn) bits for every constant t. The data structure answers tree queries in constant time. Our data structure has improved space complexity compared to the known data structures for ordered trees with lowest space complexity: The structure of Jansson et al. [14] that uses logN(n→)+O(nloglogn/logn) bits, and the structure of Navarro and Sadakane [18] that uses 2n+O(n/logtn) bits for every constant t.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.