采用二叉链表作为存储结构，树的先根遍历和其相应的二叉树的前序遍历的结果是一样的。()
采用二叉链表作为存储结构，树的先根遍历和其相应的二叉树的前序遍历的结果是一样的。()
相关考题：
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
下列关于二叉树遍历的说法正确的有: 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、若采用孩子兄弟链表作为树的存储结构，则树的后序遍历应采用二叉树的（）。A．先序序遍历算法B．层序遍历算法C．后序遍历算法D．中序遍历算法