A full binary tree with n leaves contains nodes.

A、general tree

B、full binary tree

C、binary tree

D、complete binary tree

A.

B.

C.

D.

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、完全二叉树最多只有最下面的一层结点度数可以小于2。For a complete binary tree, only the degrees of nodes on the nethermost layer could be less than 2.

E、一棵非空二叉树的为空的外部结点数目等于其结点数加1。The amount of external null nodes in a binary tree with at least one node equals to its amount of nodes plus 1.

F、满二叉树的所有结点的度均为2。All degrees of nodes in a full binary tree are 2.

根据伪满二叉树的前序序列，求ltag-rlink的二叉树前序遍历 比如：给出伪满二叉树的前序序列如下： A' B' D G' / H C' E' F I / 则可以求出ltag-rlink的二叉树前序遍历为 0A5 0B3 1D-1 1G4 1H-1 0C-1 0E8 1F-1 1I-1 (注：各个结点按照“ltag结点名rlink”的方式给出，结点之间用一个空格分隔） 现给出伪满二叉树的前序序列如下： A' B' C' / I H D' E' G / F 则所求出ltag-rlink的二叉树前序遍历为 According to the pre-order traversal sequence of a "pseudo full binary tree", please write down the pre-order traversal sequence of this binary tree in an "ltag-rlink" form. For example: Given the pre-order traversal sequence of a "pseudo full binary tree" like this: A' B' D G' / H C' E' F I / Then we can get the pre-order traversal sequence of this binary tree in the "ltag-rlink" form: 0A5 0B3 1D-1 1G4 1H-1 0C-1 0E8 1F-1 1I-1 (P.S. The form of each node should be "LtagNodeRlink", and all the nodes are separated by a single space.) Now, given the pre-order traversal sequence of a "pseudo full binary tree" like "A' B' C' / I H D' E' G / F", please write down the pre-order traversal sequence of this binary tree in the "ltag-rlink" form.

A、Huffman树一定是满二叉树。A Huffman tree must be a full binary tree.

B、Huffman编码是一种前缀编码。Huffman code is a kind of prefix code.

C、Huffman树一定是完全二叉树。A Huffman tree must be a complete binary tree.

D、Huffman编码中所有编码都是等长的。All codes in a Huffman code have the same length.

E、对于同样的一组权值两两不同的内容可以得到不同的Huffman编码方案。Different content with the same group of weights can get different Huffman codes.

F、使用频率越高的字母，Huffman编码越长。The higher a letter's frequency is, the longer its Huffman code is.

A、二叉搜索树按照中序遍历将各结点打印出将各结点打印出来，将得到按照由小到大的排列。 If we print a binary search tree's nodes according its infix order, the sequence will be from small to large.

B、如果结点χ的左子树有右子树，则存在某个结点的值介于结点χ的值和χ左儿子的值之间，并且这个结点在$$x$$的左子树之中。 If the left child tree of a node x has a right child tree, then there exists some node whose value is between the value of node x and the value of its left child node, and this node is on the left child tree of node x.

C、当根结点没有左儿子时，根结点一定是值最小的结点。If the root node doesn't have left child, it must be the node with the smallest value.

D、二叉搜索树一定是满二叉树。A binary search tree must be a full binary tree.

E、二叉搜索树一定是完全二叉树。A binary search tree must be a complete binary tree.

F、从根结点一直沿右儿子向下找不一定能找到树中值最大的结点。Along the right child of nodes all the time from the root node, it is possible that we couldn't find out the node with the largest value.

A、堆一定是满二叉树。A heap must be a full binary tree.

B、最小堆中，最下面一层最靠右的结点一定是权值最大的结点。In a minimum heap, the rightest node on the nethermost layer must be the node with the largest value.

C、堆是实现优先队列的惟一方法。A heap is the only method to implement a priority queue.

D、堆一定是完全二叉树。A heap must be a complete binary tree.

E、最小堆中，某个结点左子树中最大的结点可能比右子树中最小的结点小。In a minimum heap, the largest value on some node's left child tree could be possibly smaller than the smallest value of its right child tree.

F、使用筛选法建堆要比将元素一个一个插入堆来建堆效率高。Screening method has a higher efficiency than inserting elements one by one while constructing a heap.

Traversing a binary tree in preorder is equivalent to

A．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.