0
I tried my best to explain all Linked List.
For Single Linked List http://www.fansonnote.com/2012/02/single-linked-list/
For Double Linked List http://www.fansonnote.com/2012/02/double-linked-list/
For Multi Linked List http://www.fansonnote.com/2012/02/multi-linked-list/
Hope it will help.
Thanks.
Wiki User
∙ 11y ago
Wiki User
∙ 11y agoData structure refers to the container used for storing data. It can be arrays, linked lists, trees, etc.
Many operations can be performed on linked lists. Here are some of them:
1. insert - inserting an element into the linked list
2. remove - removing an element from the list
3. traverse - traversing through the elements of the list
4. size - returns the number of elements in the list
5. find - find whether a particular element occurs in the list
6. replace - replace a particular element
7. sort - sort the elements in the list
Add your answer:
Earn +20 pts
Which of the following data structures can be randomly accessed giving loc A. linked list implemented using array B. singly linked list C. double linked list D. both single and double linked list?
Which of the following data structures can be randomly accessed giving loc?A. linked list implemented using arrayB. singly linked listC. double linked listD. both single and double linked listThe answer is A.
Explain Pseudo code for circular linked list?
write pseudocode for link list
Explain any two advantages using Single linked list over Doubly linked list and vice-versa?
Advantages of single linked list: # Decrease in storage space per linked list node # Simpler implementation Advantages of double linked list # Decrease in work when accessing a random node # Decrease in work when inserting or deleting a node
What are generalised linked list?
A generalized linked list contains structures or elements with every one containing its own pointer. It's generalized if the list can have any deletions, insertions, and similar inserted effectively into it.
What is the main reason behind linked-list?
Linear list for example is array, linked list, stack, ... It is called linear because all elements in those data structures are in linear sequence. We have first and the last elements in the list. If there is N elements in list, we know that all elements are in such sequence na, na+1. Non-linear structures would be trees and graphs.
Which of the following data structures can be randomly accessed giving loc A. linked list implemented using array B. singly linked list C. double linked list D. both single and double linked list?
Which of the following data structures can be randomly accessed giving loc?A. linked list implemented using arrayB. singly linked listC. double linked listD. both single and double linked listThe answer is A.
Explain Pseudo code for circular linked list?
write pseudocode for link list
Explain any two advantages using Single linked list over Doubly linked list and vice-versa?
Advantages of single linked list: # Decrease in storage space per linked list node # Simpler implementation Advantages of double linked list # Decrease in work when accessing a random node # Decrease in work when inserting or deleting a node
What are generalised linked list?
A generalized linked list contains structures or elements with every one containing its own pointer. It's generalized if the list can have any deletions, insertions, and similar inserted effectively into it.
What is the main reason behind linked-list?
Linear list for example is array, linked list, stack, ... It is called linear because all elements in those data structures are in linear sequence. We have first and the last elements in the list. If there is N elements in list, we know that all elements are in such sequence na, na+1. Non-linear structures would be trees and graphs.
How linked list can be used for the polynomial manipulation?
Header linked list are frequently used for maintaining polynomials in memory. The header node plays an important part in this representation, since it is needed to represent the zero polynomial. This representation of polynomial will be presented in the context of a specific
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 linked file?
The next record in a linked list is found at the address stored in the record. Records are added at any location in the DASD(Direct Access Storage Device) and pointers adjusted to include them. Deletions are not erased, but pointers changed to omit the deleted record. Just like a normal linked list has a value part in its structures, here the linked list structure can have multiple value parts.
What is linked file organization?
The next record in a linked list is found at the address stored in the record. Records are added at any location in the DASD(Direct Access Storage Device) and pointers adjusted to include them. Deletions are not erased, but pointers changed to omit the deleted record. Just like a normal linked list has a value part in its structures, here the linked list structure can have multiple value parts.
Which is the easy insertion operator single linked-list or double-linked list?
It is easier to insert into a singly linked list.
How can you find out if a linked list is circular?
Pseudocode for detecting loops in a linked list: // keep track of which linked list nodes we've visited set nodesVisited // our list linkedlist list // current working node node current = list.root while current.next is not null if nodesVisited contains current.next we found a loop! else nodesVisited.add( current ) current = current.next // if we get here without finding a loop, then there are no loops Complete Working code And illustrative pictures can be found here about linked lists http://www.programmerinterview.com/index.php/data-structures/how-to-find-if-a-linked-list-is-circular-or-has-a-cycle-or-it-ends/
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.
