满二叉树

满二叉树

简明

1
full binary tree
满二叉树：满二叉树是每个节点都有两个子节点的二叉树。

网络释义
专业释义

1
full binary tree
（1）满二叉树(Full Binary Tree)：如果二叉树中的所有分支结点的度数均为2，且叶子结点都在同一层次上，则称此类二叉树为满二叉树。

双语例句

1
的区别是什么满二叉树和完全二叉树?。
What is the difference between a full binary tree and a complete binary tree?
2
深度为5的满二叉树到底有多少个叶子节点？
Is the depth how many leaf nodes 5's entirely two fork tree have after all?
3
有严格对称结构的满二叉树，它的度序列呈规律性排列。
Because of its tough symmetric structure, its degree sequence shows regular.

查看更多

点击反馈