exercise 4.1 E2

E2.

Write the C++ statements that are needed to create the linked configuration of nodes shown in each of the flloeing diagrams.For each part,embed these statements as part of a program that printfs the contents of each node(both data and next),thereby demonstrating that the nodes have been correctly linked.

 

(a)

struct Node
{
 Node_entry entry;
 Node*next;
 Node();
 Node(Node_entry item,Node*add_on=NULL);
}
Node::Node()
{
 next=NULL;
}
Node::Node(Node_entry item,Node*add_on)
{
 entry=item;
 next=add_on;
}
Node first_node('0');
Node*p0=&first_node;
Node*p1=new Node('1');
p0->next=p1;

 

(b)

struct Node
{
 Node_entry entry;
 Node*next;
 Node();
 Node(Node_entry item,Node*add_on=NULL);
}
Node::Node()
{
 next=NULL;
}
Node::Node(Node_entry item,Node*add_on)
{
 entry=item;
 next=add_on;
}
Node first_node('0');
Node*p0=&first_node;
Node*p1=new Node('1');
Node*p2=Node('1',p0);
 

(c)

struct Node
{
 Node_entry entry;
 Node*next;
 Node();
 Node(Node_entry item,Node*add_on=NULL);
}
Node::Node()
{
 next=NULL;
}
Node::Node(Node_entry item,Node*add_on)
{
 entry=item;
 next=add_on;
}
Node first_node('0');
Node*p0=&first_node;
Node*p1=new Node('1');
p0->next=p1;
Node*p2=Node('2',p1);
p1->next=p2;}