数据结构(四), 完美二叉树, 完全二叉树和完满二叉树

个人博客传送门

完美二叉树 (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.

• 所有节点的度都是 2
• 所有叶子节点都在同一个层级

度: 一个节点有几个孩子

完全二叉树 (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

参考

www.cnblogs.com/idorax/p/64…