为什么满二叉树叶子节点个数是n,度为2的节点个数就是n减1
时间: 2023-05-29 13:01:40 浏览: 133
满二叉树是指除了最后一层,其余每层节点数都是满的且最后一层的节点都靠左排列的二叉树。由于每个节点最多只有两个左右子节点,所以满二叉树的叶子节点只能出现在最后一层,且只有最后一层的节点数等于叶子节点的个数。而满二叉树度为2的节点都有左右两个子节点,除了最后一层没有度为2的节点外,其余每层都有度为2的节点出现,而每一层的度为2的节点个数都比叶子节点个数少1个,所以满二叉树叶子节点个数是n,度为2的节点个数就是n减1。
阅读全文
相关推荐












