1. Draw a diagram showing the structure of the list and the position of the pointer p for a and b. Redraw the complete picture after each assignment statement is completed.

class node {

public:

node( int x, node* ptr = NULL )

{

data = x; next = ptr;

}

int data;

node* next;

};

(a) node *p = nullptr;

p = new node( 10 );

p->next = new node( 20, p );

p = new node( 30, p );

(b) node *p = nullptr;

p = new node( 30 );

p = new node( 20, p );

p = new node( 10, p );

2. Tracing List Algorithms

// Use node type defined in problem 1.

void fun( node*& head, int x )

{

node* p2 = nullptr;

node* p1 = head;

while ( p1 != NULL && x > p1->data )

{

p2 = p1;

p1 = p1->next;

}

if ( p2 == nullptr )

{

head = new node( x, p1 );

}

else

{

p2->next = new node( x, p1 );

}

(a)If the function is called as follows: fun( head, 15 ); where head points to the list: draw a picture of the list pointed to by head after the call is complete:

(b) If the function is called as follows: fun( head, 40 ); where head points to the list: draw a picture of the list pointed to by head after the call is complete: head 10

Tks for any help that you can provide