By Anirudh C V
We add new node at beginning and at end of a Linked List, find length of Linked List and search an element in it. We also delete a delete a node after a given position
Linked List is a sequence of data structure connected together via links. Each element are linked using pointer. Linked List consists of nodes where each node contain data field and reference (link) to next node of list. Head pointer points the first node while Last node points to NULL.
In Singly Linked List the navigaton from one node to other node is possible only through one direction (forward only).
Advantages of using Linked List :
1. Dynamic memory allocation.
2. Easy to insert or delete a value from the list.
Submitted by Anirudh C V (AnirudhCV)
Download packets of source code on Coders Packet