Scribd Logo
Upload

Welcome to Scribd!

  • 4 Singly Linked Listpdf Lyst7205

    Uploaded by

    pumpkin.baba123
    7 views7 pages
    This document discusses singly linked lists in Python. It defines a linked list as a linear collection of data items where each item refers to the next. A node class is created with item and next attributes. Common singly linked list operations like insertion, deletion, checking if empty and traversal are also outlined. The summary provides a high-level overview of the key topics and concepts discussed in the document in 3 sentences.

    Original Description:

    Original Title

    _4_Singly_Linked_Listpdf_lyst7205

    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 singly linked lists in Python. It defines a linked list as a linear collection of data items where each item refers to the next. A node class is created with item and next attributes. Common singly linked list operations like insertion, deletion, checking if empty and traversal are also outlined. The summary provides a high-level overview of the key topics and concepts discussed in the document in 3 sentences.

    Copyright:

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

    4 Singly Linked Listpdf Lyst7205

    Uploaded by

    pumpkin.baba123
    This document discusses singly linked lists in Python. It defines a linked list as a linear collection of data items where each item refers to the next. A node class is created with item and next attributes. Common singly linked list operations like insertion, deletion, checking if empty and traversal are also outlined. The summary provides a high-level overview of the key topics and concepts discussed in the document in 3 sentences.

    Copyright:

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

    DSA using Python

    Singly Linked List

    Saurabh Shukla (MySirG)


    - Agendas
    ① What is a list ?
    ② What is a node ?
    ③ Defining a node

    ④ Singly Linked List

    ⑤ Elementary operations
    whatisalis-22.li
    St is a linear collection of data items
    also known as List Item

    int
    Example 1 : list of marks
    30,32 , 20,35 , 41,38

    str
    Example 2 : list of city names
    " "
    Delhi
    " " "
    Jaipur
    "
    Indore
    "
    "
    "
    Bhopal
    "
    Itarsi ,
    ,
    ,

    " "
    Mumbai
    " " "

    Jabalpur
    "
    Gwalior
    " "
    Pune , .

    Employee
    3 : list of Employees
    Example 104
    103
    102 "

    Jen it
    100 101 " " "
    " Shivam
    Akshay
    "
    " " "
    Atul "
    Savita
    25000 40000 30000 Soooo
    35 ooo
    whatisanc.de?-
    int
    Example 1 : list of marks
    30,32 , 20
    ,
    35
    , 41,38

    ⑤→i¥→☒*
    item next item next

    ↑ ↑
    SLL
    Node type
    Dnganode_
    Class Node :
    init ¢ self item = None next -_ None) :
    def - -
    _
    _ , ,

    self .
    item = item

    self .
    next = next
    S-inglylinkedlist.SU
    is a linear data structure .

    It and shrink
    can
    grow
    •

    SLL _
    object

    ☐+→i→→i→i:
    Operations on
    Singly Linked List

    insertion SLLC )
    obj -_

    )
    deletion obj .
    insert _
    at _
    start $ "

    insert at last
    is empty obj
    _
    _
    .

    Start Go)
    _

    at
    Obj insert
    _
    _
    .

    traverse delete first


    obj .
    _

    for x in Obi :

    *nntcsc)

    You might also like