LINKED LISTS DEFINITION A LINKED LIST IS A

LINKED LISTS

DEFINITION �A LINKED LIST IS A SEQUENCE OF NODES CONNECTED TO EACH OTHER USING POINTERS.

TYPES �SINGLY LINKED LIST �DOUBLY LINKED LIST �CIRCULARLY LINKED LIST

WHAT IS A NODE � A NODE IS A STRUCTURE THAT CONTAINS ONE OR MORE FIELDS ALONG FIELD 1 FIELD 2 FIELD 3 WITH A FIELD TO HOLD FIELD 4 THE REFERENCE TO LINK THE NEXT NODE

CREATING A LIST �CREATE A NODE. �CALL IT HEAD NODE �EVERY TIME YOU WANT TO ADD NODES DO THE FOLLOWING: CREATE A NODE ADD A LINK TO THE NEW NODE FROM THE LAST NODE CREATED

LIST CREATION DATA LINK HEAD NODE DATA LINK

DELETING A NODE DATA LINK HEAD NODE IN THE MIDDLE DATA LINK

DELETING A NODE DATA LINK HEAD NODE AT THE END DATA LINK

DELETING A NODE DATA LINK HEAD NODE DELETE HEAD DATA LINK

INSERTING A NODE DATA LINK HEAD NODE DATA LINK DATA LINK

DOUBLY LINKED LIST WITH TWO LINK TO PREV FIELD 1 FIELDS – ONE TO FIELD 2 �CONTAINS NODES PREVIOUS NODE AND ANOTHER TO NEXT NODE FIELD 3 LINK TO NEXT

DOUBLY LINKED LIST CREATION PREV HEAD NODE DATA NEXT PREV DATA NEXT TAIL NODE PREV DATA NEXT

DELETING A NODE IN A DDL PREV DELETE THIS NODE HEAD NODE DATA NEXT PREV DATA NEXT TAIL NODE PREV DATA NEXT

INSERT A NODE IN DLL PREV HEAD NODE INSERT HERE DATA NEXT PREV DATA NEXT TAIL NODE PREV DATA NEXT

CIRCULARLY LINKED LIST A SINGLY OR DOUBLY LINKED LIST WHERE THE TAIL NODE IS CONNECTED TO THE HEAD NODE IS CALLED A CIRCULARLY LINKED LIST

CIRCULARLY LINKED LIST CREATION PREV HEAD NODE DATA NEXT PREV DATA NEXT TAIL NODE PREV DATA NEXT

INSERTION / DELETION IN CLL �SIMILAR TO THE PREVIOUS TWO TYPES. CARE MUST BE TAKEN WHEN HEAD OR TAIL GETS DELETED. SOMETIMES THERE IS NO DISTINCTION AS TO HEAD OR TAIL NODE

U O Y K N A TH