Scribd
Upload
35 views2 pages

7.1.1 List Special Operations

The document describes 10 operations that can be performed on linked lists: counting nodes, inserting into a sorted list, concatenating two lists, inverting/reversing a list, searching for a data value, copying a list, creating a list by selecting alternate elements, merging sorted lists, splitting a list, and removing duplicate elements from a list.

Uploaded by

Shado H
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views2 pages

7.1.1 List Special Operations

The document describes 10 operations that can be performed on linked lists: counting nodes, inserting into a sorted list, concatenating two lists, inverting/reversing a list, searching for a data value, copying a list, creating a list by selecting alternate elements, merging sorted lists, splitting a list, and removing duplicate elements from a list.

Uploaded by

Shado H
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

List ADT – Linked List Implementation

More operations on LL
1. Counting No. of nodes 1000 100 200 300 400
2. Insertion in a sorted LL
3. Concatenation of two LL
4. Inversion/Reversing LL
5. Searching a Data x

28‐Jun‐20 ARJ 35
List ADT – Linked List Implementation
More operations on LL
6. Create a copy of LL 1000 100 200 300 400
7. Create LL by selecting alternate elements
8. Merging of sorted LL
9. Splitting a Linked List
10.Removing duplicate elements from LL

28‐Jun‐20 ARJ 36

You might also like