数据结构队列Exercises4.1E1，E2

来源：互联网发布：jsp无法实例化java 编辑：程序博客网时间：2024/05/16 09:35

Draw a diagram to illustrate the configuration of linked nodes that is created by the following statements//根据下列语句画一个图来说明链接节点的配置

Node *p0 = new Node('0');

Node *p1 = p0->next = new Node('1');

Node *p2 = p1->next = new Node('2',p1);

Write the C++ statements that are needed to create the linked configuration of nodes shown in each of the following diagrams, For each part， embed these statements as part of a program that prints the contents of each node(both data and next), there by demonstrating that the nodes have been correctly linked. //编写创建下列每个图所示的节点的链式结构所需要的C++语句。对每一部分，将这些语句作为程序的一部分嵌入到打印的每个节点内容（包括数据和下一个指针next）的程序中，从而论证节点已经正确的链接。

(a)

Node *p0 = new Node('0');

Node *p1 = p0->next = new Node('1');

(b)

Node *p0 =new Node('0');

Node *p1 = new Node('1'.p1);

Node *p2 = *p1;

(c)

Node *p0 = new node('0');

Node *p1 = *p0->next = new Node('1');

Node *p2 = *p1->next =new Node('2',p1);