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

write an algorithm given each students name and grade points for six courses.find his grade point average and group students into the gpa groups 3.5

Q. Write down an algorithm to insert a node in the beginning of the linked list.                         Ans: /* structure containing a link part and link part

How many nodes in a tree have no ancestors 1 node in atree have no ancestors.

algorithm for insertion in a queue using pointers

Postorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; }; postorder(struct NODE

A binary tree is a special tree where each non-leaf node can have atmost two child nodes. Most important types of trees which are used to model yes/no, on/off, higher/lower, i.e.,

Any Binary search tree has to contain following properties to be called as a red- black tree. 1. Each node of a tree must be either red or black. 2. The root node is always b

A significant aspect of Abstract Data Types is that they explain the properties of a data structure without specifying the details of its implementation. The properties might be im

HOW LINKED LIST HEADER WORKS? HOW TO INSERT AND DELETE ELEMENTS IN LINKED LIST?