Circular Linked List comprises adjacently placed first & last elements - Data Structure

Q.  Which type of linked list comprises the adjacently placed first and the last elements?
- Published on 27 Aug 15

a. Singly Linked List
b. Doubly Linked List
c. Circular Linked List
d. All of the above

ANSWER: Circular Linked List
 

    Discussion

  • Nirja Shah   -Posted on 18 Nov 15
    Circular Linked List comprises the adjacently placed first and the last elements. In Circular linked list, all nodes are connected to form a circle. If you implemented queue by using array, then insertion is not possible after rear reaches the last position of array. It may be the case that there are vacant positions in the array but they cannot be utilized. To overcome this problem, circular queue concept is used. In Circular Linked List Address field of Last node contain address of “First Node“. You can consider an array to be logically circular means, after (n-1) th position, 0 th position will occur.

Post your comment / Share knowledge


Enter the code shown above:
 
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)