Linked lists in C++ : Complete Tutorial

Share this post!

Vote this!

A list is a homogeneous collection of elements. Each element except the first one has a predecessor. Each element except the last one has a successor. Length of a linked list are the number of items in the list.
A linked list can be sorted or unsorted. —An unsorted list is a list in which data items are placed in no particular order. —A list in which data items are placed in a particular order is called a sorted list.
—Data is stored in a linked list dynamically – each node is created as needed —Nodes of linked lists are not necessarily stored contiguously in memory (unlike an array). —Although lists of data can be stored in arrays, linked lists provide several advantages.—  more...