(保留版权,欢迎转载。请注明原始链接:http://blog.csdn.net/markcnsc/article/details/8550292)
1. 基本连通
. 0<= si <= 1
. 0<= so <= k
(设结点的入边si,出边so,即结点的度)
k叉树的根结点:si = 0;叶子结点:so = 0;非根非叶结点:si = 1,1<= so <= k
. s = n - 1 = sum (di)
(设结点总数n,边数s,第i个结点的度di)
2. 极值界定
以完全/满二叉树为参照系,则一般二叉树满足:
. h = [Log2(n)] + 1
. n <= 2^h - 1
. m <= 2^(i - 1)
. x1 = 2*x, x2 = 2*x + 1
(设结点总数n,高度h,第i层结点数m,第x个结点的左子x1和右子x2)