【二叉树】完美二叉树
完美二叉树 (Perfect Binary Tree)
A Perfect Binary Tree(PBT) is a tree with all leaf nodes at the same depth. All internal nodes have degree 2.
一个深度为k(>=-1)且有2^(k+1) - 1个结点的二叉树称为完美二叉树
完全二叉树 (Complete Binary Tree)
A Complete Binary Tree (CBT) is a binary tree in which every level, except possibly the last, is completely filled, and all nodes
are as far left as possible.
完全二叉树从根结点到倒数第二层满足完美二叉树,最后一层可以不完全填充,其叶子结点都靠左对齐。
完满二叉树 (Full Binary Tree)
A Full Binary Tree (FBT) is a tree in which every node other than the leaves has two children.
所有非叶子结点的度都是2。(只要你有孩子,你就必然是有两个孩子。)