Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    1.1 Structure of Linked List

    Uploaded by

    Elamparithi Maniezhilan
    The document discusses the structure and advantages of linked lists over arrays. It explains that linked lists have dynamic size and allow for easy insertion and deletion, though random access is not direct. Each node of a linked list contains data and a pointer to the next node.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    1.1 Structure of Linked List

    Uploaded by

    Elamparithi Maniezhilan
    17 views1 page
    The document discusses the structure and advantages of linked lists over arrays. It explains that linked lists have dynamic size and allow for easy insertion and deletion, though random access is not direct. Each node of a linked list contains data and a pointer to the next node.

    Original Description:

    Structure of Linked List

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses the structure and advantages of linked lists over arrays. It explains that linked lists have dynamic size and allow for easy insertion and deletion, though random access is not direct. Each node of a linked list contains data and a pointer to the next node.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    17 views1 page

    1.1 Structure of Linked List

    Uploaded by

    Elamparithi Maniezhilan
    The document discusses the structure and advantages of linked lists over arrays. It explains that linked lists have dynamic size and allow for easy insertion and deletion, though random access is not direct. Each node of a linked list contains data and a pointer to the next node.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Class: II MCA Course: Advanced Data Structures and Algorithms

    1.1 Understand the Structure of Linked Lists:

    Linked List | Set 1 (Introduction)


    Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at a
    contiguous location; the elements are linked using pointers.

    Why Linked List?

    Arrays can be used to store linear data of similar types, but arrays have the following limitations.
     The size of the arrays is fixed: So we must know the upper limit on the number of elements in
    advance. Also, generally, the allocated memory is equal to the upper limit irrespective of the
    usage.
     Inserting a new element in an array of elements is expensive because the room has to be
    created for the new elements and to create room existing elements have to be shifted.
    For example, in a system, if we maintain a sorted list of IDs in an array id[].
    id[] = [1000, 1010, 1050, 2000, 2040].
    And if we want to insert a new ID 1005, then to maintain the sorted order, we have to move all the
    elements after 1000 (excluding 1000).
    Deletion is also expensive with arrays until unless some special techniques are used. For example, to
    delete 1010 in id[], everything after 1010 has to be moved.
    Advantages over arrays
     Dynamic size
     Ease of insertion/deletion

    Drawbacks:
     Random access is not allowed. We have to access elements sequentially starting from the first
    node. So we cannot do binary search with linked lists efficiently with its default implementation.
    Read about it here.
     Extra memory space for a pointer is required with each element of the list.
    Not cache friendly. Since array elements are contiguous locations, there is locality of reference
    which is not there in case of linked lists.
    Representation:
    A linked list is represented by a pointer to the first node of the linked list. The first node is called the
    head. If the linked list is empty, then the value of the head is NULL.
    Each node in a list consists of at least two parts:
     Data
     Pointer (Or Reference) to the next node
    Note: In C, we can represent a node using structures. Below is an example of a linked list node with
    integer data. In Java or C#, Linked List can be represented as a class and a Node as a separate class.
    The Linked List class contains a reference of Node class type.

    1 | Page Notes of Lessons

    You might also like