The degree distribution of an ordered tree T with n nodes is $\overrightarrow{n}=(n_0,\dots ,n_{n-1})$, where $n_i$ is the number of nodes in T with i children. Let $\mathcal{N}(\overrightarrow{n})$ be the number of trees with degree distribution $\overrightarrow{n}$. We give a data structure that stores an ordered tree T with n nodes and degree distribution $\overrightarrow{n}$ using $\log \mathcal{N}(\overrightarrow{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 $\log \mathcal{N}(\overrightarrow{n})+O(n\log \log n/\log n)$ bits, and the structure of Navarro and Sadakane [18] that uses $2n+O(n/{\log }^{t}n)$ bits for every constant t.

具有n个节点的有序树T的度分布为$\overrightarrow{ñ}=（{ñ}_0，\dots ，{ñ}_{ñ-\mathrm{1个}}）$，在哪里 ${ñ}_{\mathrm{一世}}$是T中有i个孩子的节点数。让$\mathcal{ñ}（\overrightarrow{ñ}）$ 是具有度数分布的树数 $\overrightarrow{ñ}$。我们给出一个数据结构，该结构存储具有n个节点和度分布的有序树T$\overrightarrow{ñ}$ 使用 $\mathrm{日志}\mathcal{ñ}（\overrightarrow{ñ}）+Ø（ñ/{\mathrm{日志}}^{Ť}ñ）$每个常数t的位数。数据结构以恒定的时间回答树查询。与已知的具有最小空间复杂度的有序树的数据结构相比，我们的数据结构改善了空间复杂度：Jansson等人的结构。[14]使用$\mathrm{日志}\mathcal{ñ}（\overrightarrow{ñ}）+Ø（ñ\mathrm{日志}\mathrm{日志}ñ/\mathrm{日志}ñ）$ 以及Navarro和Sadakane [18]的结构 $2ñ+Ø（ñ/{\mathrm{日志}}^{Ť}ñ）$每个常数t的位数。