对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
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.
在这个问题中，二叉树的每个节都值都为正整数，且每棵树的节点数都小于256。
In this problem each node of a binary tree contains a positive integer and all binary trees have have fewer than 256 nodes.
利用二叉树方法，通过对一个欧式期权与一个美式期权构成的复合期权进行定价，完成对风险投资问题的估价。
This paper applies a binominal lattices approach to the valuation of venture investment decision, a compounded option of a European option and an American option.
二叉树定价模型虽然适合各种期权估价，但存在缺陷，如精度问题。
Binomial tree can be applied to pricing of all kinds of options, but it has a lot of flaws, such as accuracy.
二叉树是面试里常考的一类数据结构，其中有一类寻找路径问题很有意思。目前见过两种类型题目，都是先给出一个和，然后要求打印出节点值之和与此相等的路径问题。
Given a binary tree and a number, print all the root-to-leaf paths such that adding up all the values along the path equals the given number.
对于这个问题，一个高度平衡的二叉树是指每个节点的两个子节点的深度的差异都不超过1的二叉树。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
针对数字信号调制模式识别问题，提出了运用高阶累积量和二叉树支持向量机(SVM)进行自动识别的算法。
Applying high order cumulants and support vector machines (SVM), an algorithm is proposed for automatic recognition of digital communication signals.
针对数字信号调制模式识别问题，提出了运用高阶累积量和二叉树支持向量机(SVM)进行自动识别的算法。
Applying high order cumulants and support vector machines (SVM), an algorithm is proposed for automatic recognition of digital communication signals.
应用推荐