Question:
What is Linked List ?
Answer:
Linked List is one of the fundamental data structures. It consists of a sequence of? nodes, each containing arbitrary data fields and one or two (”links”) pointing to the next and/or previous nodes. A linked list is a self-referential datatype because it contains a pointer or link to another data of the same type. Linked lists permit insertion and removal of nodes at any point in the list in constant time, but do not allow random access. Source: CoolInterview.com
In computer science, a linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains a reference (i.e., a link) to the next record in the sequence. Source: CoolInterview.com
Answered by: Nishant Sinha | Date: 9/26/2009
| Contact Nishant Sinha
A linked list is a order collection of data elements called nodes.Node can store value of the data type and it points to address of the another node. Source: CoolInterview.com
Answered by: Rehana | Date: 11/7/2009
| Contact Rehana
A linked list is a data structure which contains two nodes 1.INFO 2.Link INFO contains address of starting element. LINK contains the address of next pointer. Source: CoolInterview.com
Answered by: Aradhana yadav | Date: 11/17/2009
| Contact Aradhana yadav
A linked list is a self referential , linear data structure where each node points to another node and all the nodes are connected via links.Each node in a linked list contains two/three parts namely the data part where the data is present and the link part contains the link to the next node. Source: CoolInterview.com
Answered by: vineela | Date: 4/19/2010
| Contact vineela
If you have the better answer, then send it to us. We will display your answer after the approval.
Rules to Post Answers in CoolInterview.com:-
- There should not be any Spelling Mistakes.
- There should not be any Gramatical Errors.
- Answers must not contain any bad words.
- Answers should not be the repeat of same answer, already approved.
- Answer should be complete in itself.
|