关于出栈序列、二叉树、二叉搜索树三个问题计数的一致性

On Consistence Of Three Count Problem: Out-Stack Sequence、Binary tree、Binary-find Tree

本文用递归的方法对出栈序列、二叉树、二叉搜索树三种计数问题进行了分析,得到了一个统一的递推关系式,作者分析了这三个问题同解的原因,指出了这三个问题是同构的,对于这三个问题的解,用C++语言编程实现了算法。

By using induction approach, a united formula based on the analysis of three count problems with respect to out - stack sequence,binary tree,binary - find tree is presented in the article. It points out that the three problems are the same structure and can be realized by C ＋ ＋ programming.