翻转二叉树。
Given a binary tree, find its maximum depth.
给定一个二叉树，找到他的深度。
Given a binary tree, find its minimum depth.
给定一棵二叉树，计算其最小深度。
The final output of analysis is a binary tree.
解析的最终结果是生成一个二叉树。
Write a function to find the depth of a binary tree.
写个程序找到一个二叉树的深度。
Now, the decision tree, if I branch left, it's a binary tree.
现在，这个决策树，如果我走左边的分支，这是一棵二叉树。
Given a binary tree, determine if it is height-balanced.
判断一棵树是否为平衡二叉树。
Given a binary tree, determine if it is height-balanced.
给出一个二叉树，判断它高度是不是平衡的。
You clearly understand the characteristics of a binary tree.
让你清晰的了解到二叉树的特点。
Design an algorithm to serialize and deserialize a binary tree.
设计一个算法序列化、反序列化一棵二叉树。
One way to serialize a binary tree is to use pre-oder traversal.
先序遍历是序列化二叉树的方式之一。
A binary search tree (BST) is a binary tree with the following properties.
二进制搜索树(BST)是具有以下属性的二进制树。
A binary tree is defined as a tree where each node can have no more than two children.
树中的结点最多有两个子结点的树叫做二叉树。
How would you print out the data in a binary tree, level by level, starting at the top?
你将怎样以水平打印二叉树数据，水平，在顶开始？
A binary tree is a data structure with nodes that include no more than two linked nodes.
二叉树是一个具有节点的数据结构，其每个节点最多包含两个子节点。
A binary tree classifier based on multivariate step-wise regression was designed and implemented.
作者设计并实现了一个基于多变元逐步回归的二叉树分类器。
As an example, you will model a class node for a binary tree, with 2 Pointers to the left and right child nodes.
例如，您可以为一个二进制树建立类型Node两个指针指向左右子节点。
Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.
说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
In this problem each node of a binary tree contains a positive integer and all binary trees have have fewer than 256 nodes.
在这个问题中，二叉树的每个节都值都为正整数，且每棵树的节点数都小于256。
The services composition plan was transferred into an AOV graph equivalently, and then was transformed into a binary tree further.
首先将一个服务的组合方案等效成AOV图，并将其转换成二叉树，然后进行后续遍历并编码。
A binary tree is a collection of nodes in which each node contains two links, one to its left child and another to its right child.
一个二叉树是一系列节点的集合，每一个节点都包含有两个子节点，一个称之为左节点，而另一个称之为右节点。
You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.
你只需要能够确保二叉树可以序列化成一个字符串，并且可以反序列化成原始树结构即可。
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.
二叉树是面试里常考的一类数据结构，其中有一类寻找路径问题很有意思。目前见过两种类型题目，都是先给出一个和，然后要求打印出节点值之和与此相等的路径问题。
As input sequences are the preorder, inorder and postorder of a binary tree, we give the discussion about creating the tree to all conditions.
在输入为先根序列、中根序列与后根序列的前提下，对各种二叉树建树的情况进行了讨论；
Enhanced JFS2 USES a binary tree representation while performing inode searches, which is a much better method than the linear method used by JFS.
增强的JFS2在执行索引节点搜索时使用二叉树表示形式，与JFS使用的线性方法相比，这种方法要好得多。
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.
对于这个问题，一个高度平衡的二叉树是指每个节点的两个子节点的深度的差异都不超过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.
二叉树平衡的条件是左子树平衡且右子树平衡且左右子树的高度相差最多为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.
题目大意：给定一棵二叉树，请判断该二叉树是否是平衡二叉树。 所谓平衡二叉树就是每个节点的两颗子树深度不超过1。
With a little more effort, I can express a binary tree — a tree with each node holding a value and exactly two branches. A simple binary tree in Haskell looks like this.
只要多付出一点功夫，就能表达b树——b树的每个节点都容纳一个值和两个分支。
A binary tree routing topology is designed for propagating the system clock and trigger signal and the accurate timing and synchronization between sensors are provided by CPLD.
设计了二进制树型拓扑结构传播统一的系统时钟和触发信号，采用CPLD提供传感器间的精确时序和同步。
应用推荐