具有n个结点的完全二叉树的深度是
h = [(log2n)]下取整 + 1
log2（n) +1
[log2(n)] + 1
log2n+1
log2(n+1)
log2(n)向下取整+1
n
2^h -1 = n
h = log2(n+1)
log2n向下取整+1
log2（n+1）向上取整
jjj
log2(n+1)向上取整
[log2n]+1
log2n
log2(n+1) 向上取整
log2 n+1
log 2 n 向下取整后加1
log 2 （n+1）向上取整
log 2n向上取整+1
log2n下取整
（log2n）+1,其中log2n向下取整
h=log2(n+1)向上取整
log2(n+1)向上取整或者log2n +1其中log2n向下取整
log2n +1
log以2为底n的对数向下取整再加1
log2 n
[log2 n]+1
ëlog2nû+1
（向下取整）（log2n）+1 （向上取整）（log2[n+1]）
[log2n]+1(向下取整)
向下取整（log2n)+1
log2(n) +1,向上取整
高度：log2(n+1),向下取整；log2(n) +1,向上取整
log2(n)+1
log2+1 向下取整
LOG[2](n+1)取上界
ëlog2n...
用户登录可进行刷题及查看答案
The road of your choice, you have to go on !
粤ICP备16082171号-1
登录后提交答案