E2.
(1) Node first_node(‘0’);
Node*p0=&first_node;
Node *p1=newNode(‘1’);
P0->next= p1;
(2) Node first_node(‘0’);
Node*p0=&frist_node;
Node *p1=newNode(‘1’,p0);
Node *p2=newNode(‘1’,p0);
(3) Node first_node(‘0’);
Node*p0=&first_node;
Node *p1=newnode(‘1’);
P0->next=p1;
Node *p2=newNode(‘2’,p1);
P1->next=p2;