本文提出一种用于区域表达的数据结构——数字搜索树(DST)及其线性化编码(LDST)。
In this paper, we put forward a region representation data structure-digital search tree (DST) and its lineal encoding (LDST).
搜索稳定树的过程很有趣，因为每个页面都被视为一个非常大的数字(页面的内容)。
The process of searching the tree is interesting in that each page is treated as a very large number (the contents of the page).
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
应用推荐