Linked Lists
What is Linked Lists? Singly Linked Lists Doubly Linked Lists Circular Linked Lists Header Linked ListsStacks
What is Stack? Push Operation Pop Operation Peek Operation Linked Stack Multiple StacksQueues
What is Queues? Linear QueueSearching
What is Searching? Linear Search Binary Search Interpolation Search Jump SearchSorting
What is Sorting? Bubble Sort Insertion Sort Selection Sort Merge Sort Quick Sort Radix Sort Heap Sort Shell Sort Tree SortHashing
What is Hashing? What is Collision?The ones who are crazy enough to think they can change the world are the ones who do.- Steve Jobs
What is Linked List?
A linked list, is a linear collection of data element. A data elements, which are collected via linked list get store in different memory location i.e) non-consecutive memory location. Each data element in the non consecutive memory is said to be node. These non-consecutive memory locations cannot be accessed randomly, but insertion and deletion can be done at any point in the list in a constant time.
Why Linked List?
Unlike array, we can add any number of elements in the list.
Types of Linked List
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Header Linked List
Linked list vs Array
| Linked List | Array |
|---|---|
| Linear collection of data element | Array is a collection of data element |
| A data elements are get stored in non-consecutive memory location | A data elements are get stored in consecutive memory location |
| Linked list does not allow random access of memory location | Array allow random access of memory location |
| Any number of data element can be stored | Only fixed number of data element can be stored |
Related to Linked List
Report Us
We may make mistakes(spelling, program bug, typing mistake and etc.), So we have this container to collect mistakes. We highly respect your findings.
Report
Programming
Electrical
Interview
© Copyright 2019