网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
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
参考答案和解析
存在一棵非空二叉树，它的前序、中序和后序遍历都是一样的。;只有空二叉树和一个根结点的二叉树这两种二叉树的前序和后序遍历的顺序恰好一样。;所有结点右子树为空的二叉树的中序和后序遍历顺序恰好一样。;所有结点左子树为空的二叉树的前序和中序遍历顺序恰好一样。
更多 “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” 相关考题
考题
从供选择的答案中选出应填入下列叙述中()内的正确答案：树是结点的集合，它有(A)个根结点。二叉树有(B)个根结点，按一定的规则，任一树都可以转换成惟一对应的二叉树。二叉树的查找有深度优先和广度优先两类，深度优先包括(C)。当一棵二叉树的前序序列和中序序列分别是HGEDBFCA和EGBDHFAC时，其后序序列必是(D)，层次序列为(E)．供选择的答案A：①且只有1 ②1或多于1③0或1 ④至少2B：①且只有1 ②1或多于1③0或1 ④至少2C：①前序遍历后序遍历中序遍历②前序遍历后序遍历层次遍历③前序遍历中序遍历层次遍历④中序遍历后序遍历层次遍历D：①BDEAGFHC ②EBDGACFH②HGFEDCBA ④HFGDEABCE：①BDEACGFH ②EBDGACFH③HGFEDCBA ④HFGCDEAB
考题
●Traversing a binary tree in preorder is equivalent to (68) ．(68) A．Traversing the forest corresponding to the binary tree in root-first orderB．Traversing the forest corresponding to the binary tree in root-last orderC．Traversing the forest corresponding to the binary tree in breadth-first orderD．None of the above
考题
In a tree directory of a file system, relative path name can be used to find files for improving directory retrieval.To do this, which directory of the followings should be set up?A．parent directoryB．child directoryC．working directoryD．home directory
考题
Traversing a binary tree in preorder is equivalent toA．Traversing the forest corresponding to the binary tree in root-first order.B．Traversing the forest corresponding to the binary tree in root-last order.C．Traversing the forest corresponding to the binary tree in breadth-first order.D．None of the abovE.
考题
树的基本遍历策略可分为先根遍历和后根遍历；二叉树的基本遍历策略可分为先序遍历、中序遍历和后序遍历。这里，我们把由树转换得到的二叉树叫做这棵树对应的二叉树。结论(27)是正确的。A．树的先根遍历序列与其对应的二叉树的先序遍历序列相同B．树的后根遍历序列与其对应的二叉树的后序遍历序列相同C．树的先根遍历序列与其对应的二叉树的中序遍历序列相同D．以上都不对
考题
Which traversal method for a binary tree does the following Pascal code illustrate? Procedure traverse(p：pointer)； Begin IfpNIL Then begin Traverse (p^．left)； Process(p)； Traverse(p^．right) End； End_A．pre_orderB．middle_orderC．noneD．last_order
考题
About a business operating cycle, which of the followings is the most accurate?A．12 monthsB．half a yearC．the time span during which cash is used to acquire goods and servicesD．always longer than a year
考题
如果把由数转换得到的二叉树叫做这棵树对应的二叉树，下面结论中正确的是(11)。A．树的先根遍历与其对应的二叉树的先根遍历相同B．树的后根遍历与其对应的二叉树的后根遍历相同C．树的先根遍历与其对应的二叉树的中根遍历相同D．以上都不对
考题
设有下列二叉树:对此二叉树前序遍历的结果为 A.ACBDEFB.DEBFCAC.ABDECFSX
设有下列二叉树：对此二叉树前序遍历的结果为A.ACBDEFB.DEBFCAC.ABDECFD.DBEAFC
考题
阅读以下说明和C语言函数，将应填入(n)处的语句写在对应栏内。【说明】本程序利用非递归算法实现二叉树后序遍历。【函数】include＜stdio.h＞include＜stdlib.h＞typedef struct node{/*二叉树的结点数据结构类型*/char data;struct node *left;struct node *right;}BTREE;void SortTreelnsert(BTREE **tree, BTREE *s){if(*tree==NULL)*tree=s;elseif(s-＞data＜(*tree)-＞data)SortTreelnsert((1),s);else if(s-＞data＞=(*tree)-＞data)SortTreelnsert((2),s);}void TraversalTree(BTREE *tree){BTREE *stack[1 000],*p;int tag[1000],top=0;p=tree;do{while(p !=NULL){stack[++top]=p;(3);tag[top]=0; /*标记栈顶结点的左子树已进行过后序遍历*/}while(top＞0(4))/*栈顶结点的右子树是否被后序遍历过*/{p=stack[top--];putchar(p-＞data);}if(top＞0)/*对栈顶结点的右子树进行后序遍历*/{(5);tag[top]=1;}}while(top＞0);}void PrintSortTree(BTREE *tree){if(tree !=NULL){printSortTree(tree-＞left);putchar(tree-＞data);pdntSortTree(tree-＞right);}}main(){BTREE *root=NULL, *node;char ch;ch=getchar();while(ch !=''){node=(BTREE*)malloc(sizeof(BTREE));node-＞data=ch;node-＞left=node-＞right=NULL;SortTreelnsert(root, node);ch=getchar();}PrintSortTree(root);putchar('\n');TraversalTree(root);}
考题
有下列二叉树: 进行中序遍历的结果是( )。A.ACBDFEGB.ACBDFGEC.ABDCGEFSXB
有下列二叉树：进行中序遍历的结果是（ ）。A.ACBDFEGB.ACBDFGEC.ABDCGEFD.FCADBEG
考题
关于森林的遍历有以下说法：①森林的先序遍历等同于其对应的二叉树的先序遍历。②森林的中序遍历等同于其对应的二叉树的中序遍历。③森林的后序遍历等同于其对应的二叉树的后序遍历。④森林的后序遍历等同于其对应的二叉树的中序遍历。其中正确的是______。A．①②③B．①②C．①④D．②④
考题
Traversing a binary tree in preorder is equivalent to(68).A．Traversing the forest corresponding to the binary tree in root-first orderB．Traversing the forest corresponding to the binary tree in root-last orderC．Traversing the forest corresponding to the binary tree in breadth-first orderD．None of the above
考题
Which traversal method for a binary tree does the following Pascal code illustrate? procedure traverse (p:pointer); begin if pnil then begin traverse(p ↑ .left); process(p); traverse(p ↑ .right); end end;A．preorderB．postorderC．reorderD．inorder
考题
数据结构里，关于遍历二叉树描述正确的是（）。A、二叉树不可以被遍历B、二叉树的遍历方式有：先序遍历、中序遍历、后序遍历、按层次遍历C、二叉树的特殊形式如只有左子树的情况，是不能遍历的D、完全二叉树是不能进行遍历的
考题
Which WSDL style is suited to sending binary tree nodes as part of a SOAP message？（）A、 RPC/literalB、 RPC/encodedC、 Document/encodedD、 Document/literalE、 Document/literal wrapped
考题
单选题Which WSDL style is suited to sending binary tree nodes as part of a SOAP message？（）A
RPC/literalB
RPC/encodedC
Document/encodedD
Document/literalE
Document/literal wrapped
考题
单选题数据结构里，关于遍历二叉树描述正确的是（）。A
二叉树不可以被遍历B
二叉树的遍历方式有：先序遍历、中序遍历、后序遍历、按层次遍历C
二叉树的特殊形式如只有左子树的情况，是不能遍历的D
完全二叉树是不能进行遍历的
考题
单选题关于特殊二叉树的遍历，下列选项中说法正确的是（）。A
完全二叉树不能进行遍历B
完全二叉树可以进行遍历C
完全二叉树不可以进行遍历D
满二叉树不是完全二叉树
热门标签
最新试卷