Figure 10 illustrates how the location structure changes as we traverse the tree, here going down (always to the first left child), then right, then down.
图10展示了在我们遍历树时位置结构发生了怎样的变化，在这里向下(始终下移至左侧第一个子节点)，随后向右，然后再向下。
You must be sure that, if you're doing a right rotation, the top node has a left child.
必须要确保，如果做右旋，顶端节点必须有一个左子节点。
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.
一个二叉树是一系列节点的集合，每一个节点都包含有两个子节点，一个称之为左节点，而另一个称之为右节点。
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.
一个二叉树是一系列节点的集合，每一个节点都包含有两个子节点，一个称之为左节点，而另一个称之为右节点。
应用推荐