在 中文 中使用 二叉 的示例及其翻译为 英语
{-}
-
Political
-
Ecclesiastic
-
Programming
红黑树就是一种平衡二叉树。
所有的子树也都是二叉搜索树。
Both subtrees are also binary search trees.所有子树自身必须也是二叉搜索树。
All subtrees must be binary search trees too.你所描述的是一个均衡二叉树。
What you're describing is a balanced binary tree.二叉搜索树（BST）按序储存他们的关键字。
Binary search trees(BST) keep their keys in sorted order.我们将要具体地讨论二叉树或二叉搜索树。
We will discuss 我们的小朋友很喜欢计算机科学，尤其喜欢二叉树。
Our child likes computer science very much, especially he likes binary trees.本节将给大家介绍一类具体的树结构--二叉树。
In this section we will have a look at a specific type of tree- binary tree.给定两个二叉树，编写一个函数来检验它们是否相同。
Given two binary trees, write a function to check if they are equal or not.二叉树是用于数据存储目的的特殊的数据结构。
Binary Tree is a special data structure used for data storage purposes.或者是具有下列性质的二叉树：.
Or has the following properties of two binary tree.说完整二叉树的高度是O（logn）是什么意思？?
What does it mean to say that the height of a complete binary tree is O(log n)?面试涉及的问题主要是动态规划和二叉树，感觉这两个东西是面试最喜欢考到的了。
Interview questions are mainly involved in the planning and dynamic binary tree, I feel these two things is a favorite interview to the test.在二叉查找树强制一般要求以外，对于任何有效的红黑树增加了如下的额外要求.
In addition to the ordinary requirements imposed on binary search trees, the following additional requirements apply to red-black trees.下面的解释是使用完全的情况均衡二叉树，以帮助您了解我们如何获得对数时间复杂度。
The explanation below is using the case of a fully balanced binary tree to help you understand how we get logarithmic time complexity.手术的二叉树和二进制搜索树-二叉树可以是任何有两个孩子和一个父母的东西。
Operation of Binary Tree and 为了计算二叉搜索树的大小，必须要访问树中的每个节点。
In order to calculate the size of a binary search tree, it's necessary to visit each node in the tree.一些常见类型的二叉搜索树包括T树，AVL树，Splay树，Tango树，红黑树等。
Some common types of binary search trees include T-trees, AVL trees, Splay trees, Tango trees, Red-Black trees etc.完美二叉树的一个例子是一个人在给定深度的祖先图，因为每个人都一定有两个生父母。
An example of a perfect binary tree is the ancestry chart of a person to a given depth, as each person has two biological parents.你如何确认二叉树是否是左右子树上的镜像？”--研究科学家候选人.
How do you check if a binary tree is a mirror image on left and right sub-trees?”- Research scientist candidate.
