本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
但是只用递归函数来遍历树并不十分困难。
But walking a tree just by using recursive functions is not all that difficult.
应该熟悉下列与 XML 有关的计算机科学概念:树遍历、递归和数据重用。
You should be familiar with the following XML-related, computer-science concepts: tree traversal, recursion, and reuse of data.
应用推荐