二叉树的前序周游和中序周游如下:前序周游:EFHIGJK中序周游:HFIEJKG该二又树根中右子树的根是()。
查看答案
在计算递归函数时,如不使用递归过程,则一般情况下必须借助于()数据结构。
A. 栈
B. 树
C. 双向队列
D. 广义表
In this section, you will hear several passages. Listen to the passages carefully and then answer the questions that follow. Questions 11 to 13 are based on the following passage. At the end of the passage, you will be given 15 seconds to answer the questions. Now, listen to the passage. What is the passage mainly about
A. Selling and buying.
B. What is the market
C. Everything you do is producing for the market.
D. What the market can do for you
由分别带权为9,2,5,7的4个叶节点构造一棵哈夫曼树,该树的带权路径长度为()
A. 23
B. 37
C. 44
D. 46
若待排序序列已基本有序,要使它完全有序,则从关键码比较次数和移动次数考虑,应当使用的排序方法是()
A. 快速排序
B. 直接选择排序
C. 归并排序
D. 直接插入排序