全部

1·Binary Tree, the operation and use.

二叉树的操作和使用。

2·Given a binary tree, find its maximum depth.

给定一个二叉树，找到他的深度。

3·The final output of analysis is a binary tree.

解析的最终结果是生成一个二叉树。

4·Write a function to find the depth of a binary tree.

写个程序找到一个二叉树的深度。

5·Now, the decision tree, if I branch left, it's a binary tree.

现在，这个决策树，如果我走左边的分支，这是一棵二叉树。

6·Relationship between features are defined by binary tree.

特征关系采用二叉树表示。

7·You clearly understand the characteristics of a binary tree.

让你清晰的了解到二叉树的特点。

8·Understanding absolute values in expression parsing to binary tree?

了解表达式的解析树的绝对值？

9·The model is a generalization of conventional binary tree algorithm.

模型是传统的二元树形算法的推广。

10·A binary search tree (BST) is a binary tree with the following properties.

二进制搜索树(BST)是具有以下属性的二进制树。