下列关于Huffman树和Huffman编码的说法正确的有: Which sentences of the followings are right about Huffman tree and Huffman code:

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.

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、前序和中序遍历的顺序恰好一样的二叉树，只能是空二叉树或者独根二叉树这两种情况。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 same.

D、只有空二叉树和一个根结点的二叉树这两种二叉树的前序和后序遍历的顺序恰好一样。Only the sequences of preorder and post order of the binary tree with no nodes or only one node are the same.

E、所有结点左子树为空的二叉树的前序和后序遍历顺序恰好一样。The sequences of preorder and post order of a binary tree with all nodes without left child tree are the same.

F、所有结点右子树为空的二叉树的前序和后序遍历顺序恰好一样。The sequences of preorder and post order of a binary tree with all nodes without left child tree are the same.

G、只有空二叉树和一个根结点的二叉树这两种二叉树的中序和后序遍历的顺序恰好一样。Only the sequences of infix order and post order of the binary tree with no nodes or only one node are the same.

H、所有结点左子树为空的二叉树的中序和后序遍历顺序恰好一样。The sequences of infix order and post order of a binary tree with all nodes without left child tree are the same.

I、所有结点右子树为空的二叉树的中序和后序遍历顺序恰好一样。The sequences of infix order and post order of a binary tree with all nodes without right child tree are the same.

J、存在一棵非空二叉树，它的前序、中序和后序遍历都是一样的。There exists a binary tree with at least one node, whose preorder, infix order and post order are all the same.

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.

A、以001开头的编码不可能对应其他字母。A code beginning with 001 couldn’t correspond with other letters.

B、以000开头的编码不可能对应任何字母。Codes beginning with 000 couldn’t correspond with any letter.

C、以01开头和1开头的编码肯定对应某个字母。Codes beginning with 01 or 1 must correspongding with some letters.

D、建好的Huffman树至少包含4个叶结点。The Huffman tree contains at least 4 leaf nodes.

E、编码0和00可能对应于其他字母。Code 0 and 00 could corresponding with other letters.

A、Alpha–beta pruning is to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. Alpha–beta剪枝旨在减少其搜索树中由minimax算法评价的节点数量。

B、Alpha–beta pruning is to increase the number of nodes that are evaluated by the minimax algorithm in its search tree. Alpha–beta剪枝旨在增加其搜索树中由minimax算法评价的节点数量。

C、Alpha–beta pruning is to eliminate large parts that are evaluated by the minimax algorithm in its search tree. Alpha–beta剪枝旨在消除其搜索树中由minimax算法评价的大部分。

D、Alpha–beta pruning is to add large parts that are evaluated by the minimax algorithm in its search tree. Alpha–beta剪枝旨在添加其搜索树中由minimax算法评价的大部分。

A、Arc consistency 弧一致

B、Graph consistency 图一致

C、k-consistency k一致

D、Loop consistency 环路一致

E、Node consistency 节点一致

F、Path consistency 路径一致

G、Tree consistency 树一致

设字符集S. 其中8个字符A,B,C,D,E,F,G,H的频率是. 且是第i个Fibannaci数的值，i =1 , 2 ,···, 8. （1）给出这8个字符的Huffman树和编码. （2）如果有n个字符，其频率恰好对应前n个Fibanacei数，那么对应的Huffman树是什么结构，证明你的结论.

给出一棵树的逻辑结构T=(N,R),其中： N={A,B,C,D,E,F,G,H,I,J,K} R={r} r={(A,B),(B,E),(B,F),(F,G),(F,H),(A,C),(C,I),(C,J),(J,K),(A,D)} 试回答下列问题： Given a logical structure of a tree, T=(N, R), and N={A, B, C, D, E, F, G, H, I, J, K}, R={r}, r={(A,B), (B,E), (B,F), (F,G), (F,H), (A,C), (C,I), (C,J), (J,K), (A,D)} Please answer these questions: （1）哪个是F的父结点？which is the parent node of Node F? （2）哪些是B的子孙？which are the offspring of Node B? （3）以结点C为根的子树的深度是多少？what is the depth of the sub-tree whose root node is Node C? （注：根的层数为0，独根树深度为0，高度为1，其他题目同样如此；各个选项之间的答案用空格分隔就好；同一个选项的答案如果有多个字母，按照字典序排列，且不要以空格分隔） （P.S. the level of the root node is 0, the depth of a tree, which only has a root node, is 0, and its height is 1. Other problems have the same regulations. If there are several alphabets in one question, order them by lexicographical order, and do not add spaces.)