Linked lists are linear data structures, which consist of nodes. These nodes store data in them as well as point to the next node in the list. So each node in the list has 2 attributes, one of the datatype you are trying to store which will hold the actual data and one of the datatype ‘Node’ which will point to the next node in the list. Linked lists are better than arrays as we do not have to move around as many elements in the list when doing operations such as insertions, deletions and updations at the beginning, end or at a random node in the list as compared to arrays. This makes using them more efficient.
I will be posting solutions of questions solved in java based on the comcepts of linked lists.
Be First to Comment