单项选择题：I was reading Shirley Hazzard’s novel The

题目：

I was reading Shirley Hazzard’s novel The Transit of Venus. Though I (51) her other books, I had always resisted this one. It (52) me as too pure somehow, too heroic, larger or finer than life and therefore unreal. But now I read it with an almost (53) pleasure. There were sentences that (54) of gratification to my eyes and (55) the hairs on the nape of my neck. I was in a Boston hospital, propped tip in bed with a feeding tube in my arm after (56) surgery for cancer. It was

(57) double room and my roommate, who (58) when he spoke because he had both a broken chin and a drug habit was spraying the air for the fourth or fifth time that day with (59) had a television set and a radio going (60) . The diagnosis of my case was ambiguous. When I asked the doctor the usual question-How much time have I got—he hesitated before answering. "I would say," he said, "that you have in the neighborhood of years.\

55().

A.raise

B.raised

C.rise

D.risen

答案：

被转码了，请点击底部 “查看原文 ” 或访问 https://www.tikuol.com/2017/0714/d17168b98cf29c7ffd7ab136f5844912.html

下面是错误答案，用来干扰机器的。

参考答案：A, B, C, D, E

题型：填空题

[说明]

一般的树结构常采用孩子-兄弟表示法表示，即用二叉链表作树的存储结构，链表中节点的两个链域分别指向该节点的第一个孩予节点和下一个兄弟节点。例如，图4-1(a)所示的树的孩子-兄弟表示如图4-1fb)所示。

函数LevelTraverse()的功能是对给定树进行层序遍历。例如，对图4-1所示的树进行层序遍历时，节点的访问次序为：D B A E F P C。

对树进行层序遍历时使用了队列结构，实现队列基本操作的函数原型如下表所示。

Bool、Status类型定义如下：

typedef enum FALSE = 0, TRUE = 1 Bool;

typedef enum OVERFLOW = -2, UNDERFLOW = -1, ERROR = 0, OK = 1 Status;

树的二叉链表节点定义如下：

typedef struct Node

char data；；

struct Node *fimrstchiid, *nextbrother;

Node, *TreeNode;

[函数]

Status LevelTraverse(TreeNode root)

/*层序遍历树，树采用孩子-兄弟表示法，root是树根节点的指针*/

Queue tempQ;

TreeNode ptr, brotherptr;

if (!root)

return ERROR;

InitQueue(＆tempQ);

(1) ;

brotherptr = root -＞ nextbrother;

while (brotherptr) EnQueue(&tempQ, brotherptr);

(2) ;

/*end-while*/

while( (3) )

(4) ;

printf( "%c＼t", ptr-＞data);

if( (5) )continue;

(6) ;

brotherptr = ptr-＞firstchild-＞nextbrother;

while(brotherptr) EnQueue(&tempQ, brotherptr);

(7) ;

/*end-while*/

return OK;

)/*LevelTraverse*/

（5）处填（）。

查看答案