Link List Disadvantage

• If fix element is required for an operation then link list is not a good option because it’s consumed more memory to manage the dynamic address for the list.
• Random traversal is not possible in link list due to dynamic memory allocation which is unpredictable and scarred in memory.
• Reverse traversing is not possible in a single link list because only the next pointer is used to point next element.
• Manual delete is required because link list uses memory in heap section.
• Infinite traversal occurred in a circular list if not handled properly.
• More Time and memory required compare to array.

Download PDF Note

Next Topic