2. LINKED LIST
• The name itself depicts that the list of elements are linked
together to form node.
• In order to avoid linear cost of insertion and deletion, we
need to ensure that list is not stored contiguously, else we
have to move the entire list.
3. LINKED LIST
• Linked list consists of series of structure of node which are
not necessarily adjacent in memory
• Each structure contains the Data or Element and a pointer to
structure containing its successor ( Link for the next )
• This pointer is called Next Pointer.
• The last cell next's points to null as zero.
4. LINKED LIST
• Linked list consists of 2 parts namely Data field and Pointer
field.
5. RECAP
• Pointer variable is a variable that holds the address of another
variable.
• If Ptr is a pointer variable then Ptr is interpreted as location in
main memory.
6. TYPES OF LINKED LIST
• Singly Linked List
• Doubly Linked List
• Circular Linked List
