LINKED LISTS INTRODUCTION

Linked lists are a user defined data data structures,used to store data and memory is allocated for linked lists dynamically,linked lists can be modified based on user's interest.

It is usually modeled as structure with one data field and one address field.

Address field is used to point to next structure,data field stores some data.

usually structure is referred as a node,

A linked list can have one more address fields ,

If only one address field is used then it is called a single linked list,

If two address field are used then it is called a double linked list.

Structure definition of a single linked list:

Struct keyword is used to define a struct

struct node
{
int data;
struct node *next;
};

here data field us considered a integer and other "NEXT" field is a pointer variable which points to a structure of type "node".

These kinds of structures which stores a pointer to structure of same type are called "self referential structure"

Structure for double linked list

It has two address fields ,such that it can point to previous and next structures or nodes.

struct node
{
int data;
struct node *previous,*next;
}

These are basic blue print of a structure .It is usually seen as

data

SINGLE LINKED LIST NODE

data

DOUBLE LINKED LIST

apurva's Site

apurva appu

LINKED LISTS INTRODUCTION