二叉树问题与分治算法 Binary Tree & Divide Conquer Algorithm
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.
针对P 2 P网络中资源查找以及其自身存在的问题，提出了一种基于二叉树的P 2 P网络模型。
Focusing on the problems of the resource searching in P2P network, a P2P network model based on strictly binary tree is proposed.
文章给出了1至N全排列问题的三种求解算法，分析了该问题在栈及二叉树计数中的应用。
This article gives three algorithms for all permutations of 1 to N, analyzing the application of this problem in stack and enumeration of binary tree.
应用推荐