Scribd Logo
Upload

Welcome to Scribd!

  • CSE 1315 Lecture-12

    Uploaded by

    sajjad rahman
    8 views8 pages
    This document discusses different types of linked lists including header linked lists, circular linked lists, and two way linked lists. It covers how to traverse a circular linked list, some common linked list types, and how to delete and insert nodes in a two way linked list by updating the forward and backward pointers.

    Original Description:

    linked list linked list in c++

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses different types of linked lists including header linked lists, circular linked lists, and two way linked lists. It covers how to traverse a circular linked list, some common linked list types, and how to delete and insert nodes in a two way linked list by updating the forward and backward pointers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views8 pages

    CSE 1315 Lecture-12

    Uploaded by

    sajjad rahman
    This document discusses different types of linked lists including header linked lists, circular linked lists, and two way linked lists. It covers how to traverse a circular linked list, some common linked list types, and how to delete and insert nodes in a two way linked list by updating the forward and backward pointers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 8

    CSE 1315

    Data Structure
    Lecture-12

    Prithwiraj Bhattacharjee
    B.Sc in CSE at SUST
    Adjunct Faculty, Dept. of CSE
    Leading University, Sylhet
    Header Linked List
    Traverse a Circular Linked List
    Some Linked List Types
    Two way Linked List

    ● INFO - item
    ● Back - back pointer
    ● Forw - next pointer
    Two way circular Header list
    Delete a node from two way list

    ● FORW[BACK[LOC]] = FORW[LOC]
    ● BACK[FORW[LOC]] = BACK[LOC]
    Insert a node from two way list

    You might also like