Circular doubly linked List Using the circular doubly linked

Circular doubly linked List Using the circular doubly linked list shown here, give the expression correspond to each of the following descriptions. Use pointer names next and prev. The info member of Node 3, referenced from pointer A The info member of Node 3, referenced from pointer B. The next member of Node 5, referenced from pointer A. The next member of Node 2, referenced from pointer A. The prev member of Node 3, referenced from pointer C. Provide code or pseudo code to describe a deletion of the element pointed to by pointer C. It should longer be part of the list.

Solution

1)To find the info member, we have to use info. since A->next->next points to node 3 , but doesn\'t give the value of info part. To find info, use info value

A->next->next->info

2)same as part 1

B->next->info

3)Since the next member of node 5 is Node 1 pointed by A.So, the answer would simply be A.

A

4) The next meber of node 1 is node 2 and next member of node 2 is node 3. so,

A->next->next

5) The

C->prev->prev

6) To delete node 4 which is pointed by C. You have to do 2 steps:

first, we have to make node 3\'s next as node 5.

B->next->next=c->next

second, node 5\'s previous as node 3.

A->prev->prev=c->pre