要创建二叉树，可以简单的创建一个CSimpleBinaryTree对象并初始化。

To create the Binary Tree simply create a CSimpleBinaryTree object and initialise it.

youdao

正如我所说，二叉树排序是一种非常有效且快速的方法。

As I said, binary trees are a very efficient and fast way of sorting.

youdao

红黑树是一个自平衡的二叉查找树。

Red-black tree is a self-balancing binary search tree.

youdao

二叉树方法就是比较常用的数值方法之一。

The binomial tree is one of the numerical methods in common use.

youdao

判断一棵树是否为平衡二叉树。

Given a binary tree, determine if it is height-balanced.

youdao

二叉树是计算机科学中最基本的也是最重要的树型数据结构。

Binary trees are the most fundamental and important data structures used in computer science.

youdao

二叉树的操作和使用。

Binary Tree, the operation and use.

youdao

你可以应用八叉树到很多别的地方。

You could also apply the octree to many other things.

youdao

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

The final output of analysis is a binary tree.

youdao

三叉树已广泛应用在现代管理信息系统中。

Trinary tree has been applied widely to modern management and information system.

youdao

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

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

youdao

我知道堆总是完全二叉树。

I know that heaps are always complete binary trees.

youdao

二叉树是常用的一种数据结构。

Binary tree is a data structure, and it is often used.

youdao

给定一棵二叉树，计算其最小深度。

Given a binary tree, find its minimum depth.

youdao

给定一棵完全二叉树，计算其中节点的个数。

Given a complete binary tree, count the number of nodes.

youdao

给出一个二叉树，判断它高度是不是平衡的。

Given a binary tree, determine if it is height-balanced.

youdao

题目大意：给定两个二叉树，判断两者是否是相同的二叉树。即结构相同且对应节点的值也相同。

Given two binary trees, write a function to check if they are equal or not.

youdao

二叉树期权定价模型；

Binary tree option pricing model;

youdao

一个八叉树实际上就是一个数据结构。

An octree is actually nothing more then a data structure.

youdao

二叉搜索和二叉搜索树之间的差异？

Difference between binary search and binary search tree?

youdao

二叉搜索和二叉搜索树之间的差异？

Difference between binary search and binary search tree?

youdao