(1)已知总结点数n,求叶子结点n0
全二叉树中假设度为0,1,2的节点个数分别为n0,n1,n2
n=n0+n1+n2
n0=n2+1
消去n2,得 n=2n0+n1-1
n1只能为0或者1
所以,n0=(n+1)/2或者n0=n/2
合并为n0=(n+1)/2取整
(2)已知总结点个数n,求二叉树深度d
2^d-1=n
(3)若度为m的哈夫曼树中,其叶结点个数为n,则非叶结点的个数为(n-1)/(m-1)
(4)
(1)已知总结点数n,求叶子结点n0
全二叉树中假设度为0,1,2的节点个数分别为n0,n1,n2
n=n0+n1+n2
n0=n2+1
消去n2,得 n=2n0+n1-1
n1只能为0或者1
所以,n0=(n+1)/2或者n0=n/2
合并为n0=(n+1)/2取整
(2)已知总结点个数n,求二叉树深度d
2^d-1=n
(3)若度为m的哈夫曼树中,其叶结点个数为n,则非叶结点的个数为(n-1)/(m-1)
(4)