in Programming edited by
823 views
1 vote
1 vote

In a circular linked list last node points to the :

  1. $Head$
  2. $Tail$
  3. $First Node$
in Programming edited by
823 views

1 comment

first node
1
1

1 Answer

6 votes
6 votes
Best answer

Each node in a circularly linked list has a next pointer and a reference to an element.

In a circular linked list, the last element stores the address of the starting element.

Instead of having the last node's next pointer be null, in a circularly linked list, it points back to the first node.

Circular linked lists can be used to help the traverse the same list again and again if needed.

In a circular linked list there are two methods to know if a node is the first node or not.

  •  Either an external pointer, list, points to the first node or 
  • A header node is placed as the first node of the circular list. (header node can be separated from the others by having a dedicated flag variable to specify if the node is a header node or not.) 

The answer will be last node points to the first node of the list.

selected by

4 Comments

exactly,  Soumya :)

1
1
head pointer only point first node ,head is a just pionter ,head dont contain any data so it will not consider as a element of LL so last pointer as well as head both are point first node so answer is  first node
0
0
Can you please explain the concept of Sentinal???(In Circular Linked List)
0
0
Answer:

Related questions