看完后很好，中英文的， Full binary tree: Each node is either a leaf or internal node with exactly two non-empty children. Complete binary tree: If the height of the tree is d, then all levels except possibly level d-1 are completely full. The bottom level has all nodes to the left side.
