Define Circular List?

1.	Define Circular List?
Answer» In linear list the next field of the last node contain a null POINTER, when a next field in the last node contain a pointer back to the FIRST node it is called CIRCULAR list. ADVANTAGES – From any point in the list it is possible to reach at any other point. In linear list the next field of the last node contain a null pointer, when a next field in the last node contain a pointer back to the first node it is called circular list. Advantages – From any point in the list it is possible to reach at any other point.

Answer»

In linear list the next field of the last node contain a null POINTER, when a next field in the last node contain a pointer back to the FIRST node it is called CIRCULAR list.

ADVANTAGES – From any point in the list it is possible to reach at any other point.

In linear list the next field of the last node contain a null pointer, when a next field in the last node contain a pointer back to the first node it is called circular list.

Advantages – From any point in the list it is possible to reach at any other point.

Discussion

No Comment Found

Related InterviewSolutions

Difference Between Abstract Data Type, Data Type And Data Structure?
Define Data Type And What Are The Types Of Data Type?
Define An Abstract Data Type (adt)?
What Are The Advantages Of Modularity?
State The Difference Between Primitive And Non-primitive Data Types?
State The Difference Between Persistent And Ephemeral Data Structure?
What Are The Objectives Of Studying Data Structures?
What Are The Types Of Queues?
List The Applications Of Stacks?
List The Applications Of Queues?