Define linked list ?, Data Structure & Algorithms

Linked lists are among the most common and easiest data structures. They may be used to implement various other common abstract data types, including queues, stacks, symbolic expressions, and associative arrays, though it is not uncommon to execute the other data structures directly without using a list as the basis of implementation.

The principal benefit of a linked list over a conventional array is that the list components can easily be removed or inserted without reorganization or reallocation of the entire structure because the data items have not be stored contiguously in disk or on memory. Linked lists allow removal and insertion of nodes at any point in the list, and may do so with a constant number of functions if the link previous to the link being removed or added is maintained during list traversal.

On the other hand, simple linked lists by themselves do not allow random access to the data, or any form of accurate indexing. Thus, many basic operations - such as obtaining the last node of the list, or finding a node that retain a given locating, or datum the place where a new node could be inserted - may need scanning all or most of the list components.

 

1261_Linked List.png

Posted Date: 7/27/2012 6:42:36 AM | Location : United States







Related Discussions:- Define linked list ?, Assignment Help, Ask Question on Define linked list ?, Get Answer, Expert's Help, Define linked list ? Discussions

Write discussion on Define linked list ?
Your posts are moderated
Related Questions
Easy algorithm for beginner for quicksort with explanation

In this unit, the following four advanced data structures have been practically emphasized. These may be considered as alternative to a height balanced tree, i.e., AVL tree.

creation,insertion,deletion of header linked list using c.

What are the things require to implement ADT Abstract data types are very useful for helping us understand the mathematical objects which we use in our computations but, of cou

circular queue using c

Since memory is becoming more & cheaper, the prominence of runtime complexity is enhancing. However, it is very much significant to analyses the amount of memory utilized by a prog

In the earlier unit, we have discussed about the arrays. Arrays are data structures of fixed size. Insertion & deletion involves reshuffling of array elements. Thus, arraymanipulat

A useful tool which is used for specifying the logical properties of a data type is called the abstract data type or ADT. The term "abstract data type" refers to the fundamental ma

Prove that uniform cost search and breadth- first search with constant steps are optimal when used with the Graph-Search algorithm (see Figure). Show a state space with varying ste

Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr