Fundamental of Singly Linked List Creation and Insertion and Analysis

Abstract

Linked list is a dynamic data structure that can be grow and shrink at run time. insertion and deletion operation are easier. Efficient memory utilization there is no need to pre memory allocation. Faster access time can be expanded in constant access time without memory overhead. linear data structure is easy to implement such like stack and queue.