Part 1- Introduction to Linked List | Linked List tutorials in C#

 What is Linked List

  • In simple words, a linked list is a collection of nodes where each node is connected to the next node through a pointer. 
  • A linked list is a linear data structure or dynamic data structure which contain nodes and where each node contains 2 items, one is a data field and another is the reference(pointer) to the next element or node in the list.

Link list Basic Operations

Insertion − Adds an element at the beginning of the list.
Deletion − Deletes an element at the beginning of the list.
Display − Displays the complete list.
Search − Searches an element using the given key.
Delete − Deletes an element using the given key.

Advantages of Linked Lists
  • They are a dynamic in nature which allocates the memory when required.
  • Insertion and deletion operations can be easily implemented.
  • Stacks and queues can be easily executed.
  • Linked List reduces the access time.
Disadvantages of Linked Lists

  • The memory is wasted as pointers require extra memory for storage.
  • No element can be accessed randomly; it has to access each node sequentially.
  • Reverse Traversing is difficult in linked list.
Applications of Linked Lists
  • Linked lists are used to implement stacks, queues, graphs, etc.
  • Mostly Linked list we use for Sorting the data.
  • Linked lists let you insert elements at the beginning and end of the list.
  • In Linked Lists we don't need to know the size in advance.

Share this

Related Posts

Next Post »