完满(Full)二叉树，完全(Complete)二叉树， 完美(Perfect)二叉树

完美二叉树 Perfect Binary Tree	Every node except the leaf nodes have two children and every level (last level too) is completely filled. 除了叶子结点之外的每一个结点都有两个孩子，每一层(当然包含最后一层)都被完全填充。
完全二叉树 Complete Binary Tree	Every level except the last level is completely filled and all the nodes are left justified. 除了最后一层之外的其他每一层都被完全填充，并且所有结点都保持向左对齐。
完满二叉树 Full/Strictly Binary Tree	Every node except the leaf nodes have two children. 除了叶子结点之外的每一个结点都有两个孩子结点。