wiki上的解釋
A full binary tree (sometimes proper binary tree or 2-tree) is a
tree in which
every node other than the leaves has two children.
A perfect binary tree is a full binary tree in which all leaves are at the
same depth or same level. (This is ambiguously also called a complete
binary tree.)
A complete binary tree is a binary tree in which every level,
except possibly the last, is completely filled, and all nodes are as
far left as possible.
http://en.wikipedia.org/wiki/Binary_tree
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.38.99.172