About Binary Tree

阅读更多

CLRS
-----
1) full binary tree: an ordered tree in which each internal node has degree 2
2) A complete k-ary tree: k-ary tree in which all leaves have the same depth and 
   all internal nodes have degree k


严版数据结构
----------
1）满二叉树：深度为k且有2^k-1个结点的二叉树
2）完全二叉数：深度为k的，有n个结点的二叉树，当且仅当其每一个结点都与深度为k的
   满二叉树中编号从1到n的结点一一对应时。

http://en.wikipedia.org/wiki/Binary_tree
-----------------------------------------

Wikipedia	CLRS	严版数据结构
Full binary tree	1)
Complete binary tree		2)
Perfect binary tree	2)	1)