A.错误
B.正确
第1题:
若采用孩子兄弟链表作为树的存储结构,则树的后序遍历应采用二叉树的 ( )
A.层次遍历算法
B.前序遍历算法
C.中序遍历算法
D.后序遍历算法
第2题:
2、下列关于二叉树遍历的说法正确的有: Which sentences of the followings are right about traversal of a binary tree:
A.前序和中序遍历的顺序恰好一样的二叉树,只能是空二叉树或者独根二叉树这两种情况。Only the sequences of preorder and infix order of the binary tree with no nodes or only one node are the same.
B.所有结点左子树为空的二叉树的前序和中序遍历顺序恰好一样。The sequences of preorder and infix order of a binary tree with all nodes without left child tree are the same.
C.所有结点右子树为空的二叉树的前序和中序遍历顺序恰好一样。The sequences of preorder and infix order of a binary tree with all nodes without right child tree are the sam
第3题:
下列关于二叉树遍历的说法正确的有: Which sentences of the followings are right about traversal of a binary tree:
A.前序和中序遍历的顺序恰好一样的二叉树,只能是空二叉树或者独根二叉树这两种情况。Only the sequences of preorder and infix order of the binary tree with no nodes or only one node are the same.
B.所有结点左子树为空的二叉树的前序和中序遍历顺序恰好一样。The sequences of preorder and infix order of a binary tree with all nodes without left child tree are the same.
C.所有结点右子树为空的二叉树的前序和中序遍历顺序恰好一样。The sequences of preorder and infix order of a binary tree with all nodes without right child tree are the sam
第4题:
69、先根遍历树和前序遍历与该树对应的二叉树,其结果相同。
第5题:
如果二叉树的后序遍历结果是FDEBGCA,中序遍历结果是FDBEACG,那么该二叉树的前序遍历结果是什么?
A.ABCDEFG
B.ABDFEGC
C.ABDFECG
D.ABDEFCG