C++ Representation of Linked List

C++ Representation of Linked List

typedef struct node

{

      int data; /* data field */

      struct node * next; /* link field */

}SLL;

while declaring C++ structure for a linked list ‒

• Declare a structure in which two members are there i.e. data member and next pointer member.

• The data member can be character or integer or real kind of data depending upon the type of the information that the linked list is having.

• The 'next' member is essentially of a pointer type. And the pointer should be of structure type. Because the 'next' field holds the address of next node. And each node is basically a structure consisting of 'data' and 'next'.

Advantages of linked organization :

1. In linked organization, insertion and deletion of elements can be efficiently done.

2. There is no wastage of memory. The memory can be allocated and deallocated as per requirement.

Disadvantages of linked organization :

1. Linked organization does not support random or direct access.

2. Each data field should be supported by a link field to point to next node.

Key Point

The linked list is a collection of nodes. Each node consists of two fields: 'data' field and 'link' field.

Reveiw Questions

1. What is the need of linked list ?

2. Write a note on singly linked lists.