answersLogoWhite

0


Best Answer

Linked list is a dynamic data structure that contains a "link" to the structure containing the next item. It is a collection of structures ordered not by their physical placement in memory (like array) but by logical links that are stored as part of the data in the structure itself.

Advantages of Linked Lists

- Dynamic structure (Mem. Allocated at run-time).

- We can have more than one datatype.

- Re-arrange of linked list is easy (Insertion-Deletion).

- It doesn't waste memory.

Disadvantages of Linked Lists

- In linked list, if we want to access any node it is difficult.

- It is occupying more memory.

User Avatar

Wiki User

12y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

11y ago
Linked ListLinked list is a dynamic data structure that contains a "link" to the structure containing the next item. It is a collection of structures ordered not by their physical placement in memory (like array) but by logical links that are stored as part of the data in the structure itself. Self-Referential StructureA structure which is referencing to another structure of same type is called self referential structure. MallocIt allocates memory at run time and returns pointer to first byte of memory. Advantages of Linked Lists- Dynamic structure (Mem. Allocated at run-time).

- We can have more than one datatype.

- Re-arrange of linked list is easy (Insertion-Deletion).

- It doesn't waste memory.

Disadvantages of Linked Lists- In linked list, if we want to access any node it is difficult.

- It is occupying more memory.

Types of Linked List- Singly or Chain Linked List.

- Doubly or Two Way Linked List.

- Circular Linked List.

- Circular Doubly Linked List.

Singly or Chain Linked ListThe way to represent a linear list is to expand each node to contain a link or pointer to the next node. This representation is called a one-way chain or singly linked list. Circular Linked ListA linked list in which the pointer of the last node points to the first node of the list is called circular linked list. Doubly or Two-Way Linked ListA linked list which can be traversed both in backward as well as forward direction is called doubly linked list. It uses double set of pointers. Circular Doubly Linked ListIt employs both the forward pointer and backward pointer in circular form.
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Advantage and disadvantage of linked list?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

What is a linked list used for?

A linked list is used in computer science to store data as a series of related nodes. Linked lists are used as the basis for abstract data types when programming. The chief advantage of a linked list is that data can be added or removed from the list without having to reorganize the whole list. A drawback to linked lists can be that it is difficult to sort, organize, or recall specific information from the list.


What is the advantage of doubly linked list over Doubly linked list?

A doubly linked list can be traversed in both directions (forward and backward). A singly linked list can only be traversed in one direction. A node on a doubly linked list may be deleted with little trouble, since we have pointers to the previous and next nodes. A node on a singly linked list cannot be removed unless we have the pointer to its predecessor. On the flip side however, a doubly linked list needs more operations while inserting or deleting and it needs more space (to store the extra pointer).


Convert single linked list to double linked list?

You copy a singly linked list into a doubly linked list by iterating over the singly linked list and, for each element, calling the doubly linked list insert function.


What is the difference between linked list and Ordinary list?

A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.


What is difference between linked list and singly linked list?

Answersingly linked list has the node inserted only at one end. and the pointer corresponds to the next pointer.but in a doubly linked list, the node pointer points to the both previous and the next node.singly linked list has two nodesdoubly linked list has three nodesA doubly linked list makes sense when you need to traverse the list in both directions. You aren't able to do that with a singly linked list.

Related questions

List the advantage and disadvantage of database management system?

Answering "List the advantage and disadvantage of object oriented database model?" Answering "List the advantage and disadvantage of object oriented database model?"


What is the disadvantage of singly linked list?

This is a searching question.


Adavantage of pointer based of a list over an array?

One advantage of a linked list (with pointers) is that it is fairly cheap to insert or delete an element - once you know where it is. A disadvantage is that getting a specific element - for example, the 1000th. element - is expensive.


List an advantage and a disadvantage of sitting in the gallery behind the stage?

Advantage- everyone could see you Disadvantage- expensive and was also not conducive to either seeing or hearing the actors on stage.


Definitions of single and double linked list?

A singly linked list has a single pointer in each element, pointing to the next element in the list. Travering the list can only be done in one direction. If you need to find the element prior to a certain element, you must traverse the list from the beginning, looking for an element with a next pointer that points to that certain element. A doubly linked list has two pointers in each element, pointing to the next and last elements in the list. Traversing the list can be done in two directions. The advantage of single is only one pointer, saving some space, while the disadvantage is ability to only traverse in one direction. The advantage of double is ability to traverse in both directions, while the disadvantage is the memory associated with the second pointer and the extra code and time used to update more pointers.


What are the advantage and disadvantage of fidelio?

What are the advantage and disadvantage of fidelio?"


What is a linked list used for?

A linked list is used in computer science to store data as a series of related nodes. Linked lists are used as the basis for abstract data types when programming. The chief advantage of a linked list is that data can be added or removed from the list without having to reorganize the whole list. A drawback to linked lists can be that it is difficult to sort, organize, or recall specific information from the list.


What is OCR and Advantages and disadvantage of OCR?

OCR stands for Optical Character Recognition, which is the technology that enables the conversion of different types of documents, such as scanned paper documents, PDF files, or images captured by a digital camera, into editable and searchable data. Advantages of OCR technology include increased efficiency by automating data entry processes, improved accuracy in converting text, and the ability to digitize and archive large volumes of documents. Disadvantages of OCR may include errors in character recognition, especially with poor quality documents or handwritten text, the need for manual verification in some cases, and potential privacy concerns when sensitive information is processed.


Advantage and disadvantage of sparse index over the dence index?

Sparse advantage, less storage space required Dense advantage faster since each index key is directly linked to a record key


What are the advantage and disadvantage of branch libraries?

what are the advantage and disadvantage branch libraries


What are the advantage and disadvantage of sampling techniques?

what are the advantage of and disadvantage of sampling method


What is the advantage and disadvantage of market free?

advantage is its fpree. Disadvantage is that its not fpree.