Question

in a doubly circular linked list what willbe the contents of right address field of last node​

Answer 1

in a doubly circular linked list what willbe the contents of right address field of last node

Answer- Address of first node

Answer 2

Answer:

Address of first node

Explanation:

Circular doubly linked list is a more complexed type of data structure in which a node contain pointers to its previous node as well as the next node. Circular doubly linked list doesn't contain NULL in any of the node. The last node of the list contains the address of the first node of the list. The first node of the list also contain address of the last node in its previous pointer. circular doubly linked list. The variable head contains the address of the first element of the list i.e. 1 hence the starting node of the list contains data A is stored at address 1. Since, each node of the list is supposed to have three parts therefore, the starting node of the list contains address of the last node i.e. 8 and the next node i.e. 4. The last node of the list that is stored at address 8 and containing data as 6, contains address of the first node of the list as shown in the image i.e. 1. In circular doubly linked list, the last node is identified by the address of the first node which is stored in the next part of the last node therefore the node which contains the address of the first node, is actually the last node of the list.

For more refers to-

https://brainly.in/question/47520657?referrer=searchResults

https://brainly.in/question/4234614?referrer=searchResults

#SPJ3