Linked List Deletion

Linked List Deletion is a computational operation in data structure management that removes a specified node from a linked list by adjusting the pointers of adjacent nodes to bypass the target node, thereby maintaining the list's connectivity.

1

Publications

39

Citations

5

Authors

1

Institutions

Publications per year

2017–2026

0

Authors

5

  1. QG
    Qijun Gu

    Texas State University, United States

    1 publications · 39 citations

    1

    h-index

  2. TJ
    Tongdan Jin

    Texas State University, United States

    1 publications · 39 citations

    1

    h-index

  3. SA
    Sarah Abdulsalam

    Texas State University, United States

    1 publications · 39 citations

    1

    h-index

  4. DL
    Donna LaKomski

    Texas State University, United States

    1 publications · 39 citations

    1

    h-index

  5. ZZ
    Ziliang Zong

    Texas State University, United States

    1 publications · 39 citations

    1

    h-index

1–5 of 5

Institutions

1

  1. Texas State University

    San Marcos, United States

    1 h-index

    5 publications

    195 citations

  2. Winston-Salem State University

    Winston-Salem, United States

    1 publications

    10 citations

1–2 of 1