下列关于二叉树性质的说法正确的有：（多选） Which sentences of the followings are right about
已帮助 人
下列关于二叉树性质的说法正确的有：（多选） Which sentences of the followings are right about a binary tree"s characterization:（There are more than one correct answers）
A.非空满二叉树的结点个数一定为奇数个。 The amount of nodes of a full binary tree with at least one node must be odd.
B.非完全二叉树也可以用像完全二叉树那样使用顺序存储结构进行存储。Sequential storing structure can also be used to store an incomplete binary tree just like to store a complete binary tree.
C.当一棵完全二叉树是满二叉树时，叶子结点不一定集中在最下面一层。If a complete binary tree is a full binary tree, it will be possible that leaf nodes is no t on the nethermost layer.
D.完全二叉树最多只有最下面的一层结点
回答
共1条回复-
ACD