-->
当前位置:首页 > 题库 > 正文内容

单选题:A "full tree" of degree 3 (every non-leaf node has 3 children) h

Luz4年前 (2022-01-18)题库602
A "full tree" of degree 3 (every non-leaf node has 3 children) has 31 nodes. Then its height $$h$$ is at most ____. Note: $$h=0$$ for a single node tree.



A.cannot be determined
B.11
C.10
D.9


答案:C

发表评论

访客

◎欢迎参与讨论,请在这里发表您的看法和观点。