Scribd Logo
Upload

Welcome to Scribd!

  • 42 views

    Introduction To Linked List

    Uploaded by

    ramesh
    This document discusses different types of linked lists, including singly linked lists, doubly linked lists, and circular linked lists. It introduces linked lists as a linear and dynamic data structure composed of nodes that contain data and address fields. Singly linked lists are described as linear lists of nodes where each node has a data field and an address field pointing to the next node, except for the last node which points to NULL. Basic operations on singly linked lists like insertion, deletion, and traversal are also mentioned.

    Copyright:

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

    Introduction To Linked List

    Uploaded by

    ramesh
    42 views1 page
    This document discusses different types of linked lists, including singly linked lists, doubly linked lists, and circular linked lists. It introduces linked lists as a linear and dynamic data structure composed of nodes that contain data and address fields. Singly linked lists are described as linear lists of nodes where each node has a data field and an address field pointing to the next node, except for the last node which points to NULL. Basic operations on singly linked lists like insertion, deletion, and traversal are also mentioned.

    Original Title

    linked list

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses different types of linked lists, including singly linked lists, doubly linked lists, and circular linked lists. It introduces linked lists as a linear and dynamic data structure composed of nodes that contain data and address fields. Singly linked lists are described as linear lists of nodes where each node has a data field and an address field pointing to the next node, except for the last node which points to NULL. Basic operations on singly linked lists like insertion, deletion, and traversal are also mentioned.

    Copyright:

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

    Introduction To Linked List

    Uploaded by

    ramesh
    This document discusses different types of linked lists, including singly linked lists, doubly linked lists, and circular linked lists. It introduces linked lists as a linear and dynamic data structure composed of nodes that contain data and address fields. Singly linked lists are described as linear lists of nodes where each node has a data field and an address field pointing to the next node, except for the last node which points to NULL. Basic operations on singly linked lists like insertion, deletion, and traversal are also mentioned.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 1

    LINKED LIST

    We have already learned about array and its limitations. In this we will learn about the linear and dynamic
    data structure called linked list. There are three types of linked list available which are singly linked list,
    doubly linked list and circular linked list.

    INTRODUCTION TO LINKED LIST


    Linked list is a linear dynamic data structure. It is a collection of
    some nodes containing homogeneous elements. Each node consists of a
    data part and one or more address part depending upon the types of the
    linked list. There three different types of linked list available which are singly
    linked list, doubly linked list and circular linked list.

    SINGLY LINKED LIST


    Singly linked list is a linked list which is a linear list of some nodes
    containing homogeneous elements .Each node in a singly linked list consists
    of two parts, one is data part and another is address part. The data part
    contains the data or information and except the last node, the address part
    contains the address of the next node in the list. The address part of the last
    node in the list contains NULL. Here one pointer is used to point the first
    node in the list. Now in the following sections, we are going to discussed
    three basic operations on singly linked list which are insertion of a new
    node, deletion of a node and traversing the linked list.

    You might also like