假设双链表结点的类型如下：  Typedef struct linknode  {int data;         /*数据域*/  struct linknode *llink;  /*llink是指向前驱结点的指针域*/  struct linknode *rlink;  /*rlink是指向后续结点的指针域*/  }bnode  下面给出的算法段是要把一个q所指的新结点作为非空双向链表中的p所指结点的前驱结点插入到该双链表中，能正确完成要求的算法段是()。

(86)

(84)

(85)

Electronic mail and filing permit a user to compose and transmit a message on an office(71)system. In the early 1970s, the ARPANET community developed a number of such systems which have been heavily used. Through standard message format(72), several hundred different computers and electronic mail interfaces are specification of how(73)and return addresses should appear on envelopes and which sizes are allowable for envelopes. In the electronic message world, they describe what(74)of characters are required at the(75)of a message to identify the sending and receiving mailboxes.

(83)

(81)

(80)

由固定分区方式发展到分页存储管理方式的主要推动力是(14)；由分页系统发展为分段系统，进而又发展为段页式系统的主要目的来源于(15)和(16)。

(78)

8层完全二叉树至少有(63)个结点，拥有100个结点的完全二叉树的最大层数为(64)。