Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / 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 |
Post New Answer View All Answers
What is a singletonlist?
Explain in brief a linked list.
How to sequentially represent max-heap?
What is a vector element?
Can we add duplicate keys in a hashmap?
What is the difference between hashmap and treemap?
How do you sort a map by key?
Is null a binary search tree?
List the applications of stacks?
What is difference between hashmap and treemap?
What is a matrix? Explain its uses with an example
Can we add elements to final list?
Is char array null terminated?
Which sorting is stable?
What is a graph?
