Every node in the size tree will have lesser size nodes in its left subtree and greater size nodes in the right subtree.
大小树中的每个节点都比左边子树中的节点小，比右边子树中的节点大。
Every node in the address tree will have lesser address nodes in its left subtree and higher address nodes in its right subtree.
地址树中每个节点的地址都比左边子树中的节点低，比右边子树中的节点高。
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.
根据建立好的哈夫曼树我们进行编码，从根结点出发在左子树则标为0，右则标为1。
This not only forces you to clean up the source nodes that are left behind, but it can also be expensive if the subtree you're moving is large.
这不仅要求清除留在后面的源节点，而且当要移动的子树很大时需要付出很高的代价。
Subtree node is usually referred to as the "left sub-tree" and "the right sub-tree".
通常节点的子树被称作“左子树”和“右子树”。
Subtree node is usually referred to as the "left sub-tree" and "the right sub-tree".
通常节点的子树被称作“左子树”和“右子树”。
应用推荐