## Abstract

The degree distribution of an ordered tree T with n nodes is n→=(n_{0},…,n_{n−1}), where n_{i} 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/log^{t}n) 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/log^{t}n) bits for every constant t.

Original language | English |
---|---|

Pages (from-to) | 119-130 |

Number of pages | 12 |

Journal | Journal of Computer and System Sciences |

Volume | 118 |

DOIs | |

State | Published - 1 Jun 2021 |

## Keywords

- Ordered trees
- Succinct data structures

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics