Explain about the types of linked lists
Answers were Sorted based on User's Feedback
Answer / angu
Singly linked list- which is linear direction that has only
head part.
Doubly linked list- which is bi-directional that has both
head and tail part
Circular linked list- which as no ends.
Is This Answer Correct ? | 12 Yes | 0 No |
Answer / vignesh1988i
as for as i know this concept their are three linked lists
1)linear or simple linked lists
2)doubly linked lists
3)circular linked lists
SIMPLE LL :
this contains a node which has two parts, see that a node is a STRUCTURE.one is data and other one is a pointer which is called self referencial pointers, so we must make it to point to the next location of second node created dynamically
DOUBLY LL :
a node will consists of previous node address , a data & next node address which can move backwards to the very first address
Circular ll :
here we will have the node consists of same thing but defaulty when it finishes the last node aand come to the first node
Is This Answer Correct ? | 12 Yes | 0 No |
Answer / touchriverian
singly LL
doubly LL
circular LL
doubly linked circular list
Is This Answer Correct ? | 8 Yes | 0 No |
Answer / deepak pareek
1.singly link list
2.circular LL
3.doubly circular LL
4.doubly LL
Is This Answer Correct ? | 5 Yes | 0 No |
Answer / yogesh l. sharma
there are main four type of linked list.
1)singly linked list.
2)singly circular linked list.
3)doubly linked list.
4)doubly circular linked list.
Is This Answer Correct ? | 4 Yes | 0 No |
Which of the collections allows null as the key?
What do you mean by linear probing?
What is B+ tree?
6 Answers BMC, CMC, Satyam, TCS,
What are the major data structures used in the following areas : network data model & hierarchical data model?
Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topological order and then apploy the fact that every vertex must come before its successors in the topolgical order.
What do you mean by shortest path?
State the rules to be followed during infix to postfix conversions?
How do you reference all the elements in a one-dimension array?
What is unmodifiable list?
Which is the parent class of abstractqueue class?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What is a pass in bubble sort?