What is a Linked List | Data Structure | Implementation

Linked lists are among the simplest and most common data structures. They can be used to implement several other common abstract data types, including lists, stacks, queues, associative arrays, and S-expressions, though it is not uncommon to implement those data structures directly without using a linked list as the basis.
Linked list are dynamic, so the length of list can increase or decrease as necessary. Each node does not necessarily follow the previous one physically in the memory.
Linked lists allow insertion and removal of nodes at any point in the list, and allow doing so with a constant number of operations by keeping the link previous to the link being added or removed in memory during list traversal.

On the other hand, since simple linked lists by themselves do not allow random access to the data or any form of efficient indexing, many basic operations—such as obtaining the last node of the list, finding a node that contains a given datum, or locating the place where a new node should be inserted—may require iterating through most or all of the list elements.

Connect with me on Linkedin:
https://www.linkedin.com/in/khushboo-goel-0123

You can find solutions of leetcode june challenge in both
- PYTHON
- C++
here:
https://github.com/KhushbooGoel01/Leetcode-JUNE-Challenge

May challenge:
https://github.com/KhushbooGoel01/Leetcode-MAY-Challenge
Video solution:https://www.youtube.com/playlist?list=PLlMTxcUZWpmB2mRc8wJs1x6WyjqUm58Do