Skip to content

Latest commit

 

History

History
17 lines (13 loc) · 640 Bytes

File metadata and controls

17 lines (13 loc) · 640 Bytes

Linked List

Linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers.

Example

Operations

  • Insert - Adds a new node to the end of the list.
  • Remove - Removes a node from the list.
  • RemoveAt - Removes a node from the list at a given index.
  • Search - Finds a node in the list.
  • Sort - Sorts the list.
  • Reverse - Reverses the list.
  • Merge - Merges two lists.
  • Split - Splits a list into two lists.
  • SplitAt - Splits a list into two lists at a given index.