Define Linked Lists?

1.	Define Linked Lists?
Answer» Linked list consists of a series of structures, which are not necessarily adjacent in memory. Each STRUCTURE CONTAINS the element and a POINTER to a structure containing its successor. We call this the Next Pointer. The LAST cell’s Next pointer points to NULL. Linked list consists of a series of structures, which are not necessarily adjacent in memory. Each structure contains the element and a pointer to a structure containing its successor. We call this the Next Pointer. The last cell’s Next pointer points to NULL.

Answer»

Linked list consists of a series of structures, which are not necessarily adjacent in memory. Each STRUCTURE CONTAINS the element and a POINTER to a structure containing its successor. We call this the Next Pointer. The LAST cell’s Next pointer points to NULL.

Linked list consists of a series of structures, which are not necessarily adjacent in memory. Each structure contains the element and a pointer to a structure containing its successor. We call this the Next Pointer. The last cell’s Next pointer points to NULL.

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?