左子树 [计] left subtree ; NODE pLeft ; left child ; ADBCE
构造左子树 CreateBiTree ; CreateBiTree- lchild
左子树中的最长距离 int nMaxLeft
搜索左子树 if
遍历左子树 Preorder
存放左子树的指针 struct tree left
左子树指针 struct _binary_search_tree left ; struct _binary_tree left
根的左子树 [计] left subtree of the root
进入左子树 if
拆分左子树 newtreesplit
通常节点的子树被称作“左子树”和“右子树”。
Subtree node is usually referred to as the "left sub-tree" and "the right sub-tree".
根据建立好的哈夫曼树我们进行编码，从根结点出发在左子树则标为0，右则标为1。
According to our well-established Huffman coding, starting from the root node in the left subtree is marked as 0, the right is labeled 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.
应用推荐