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
Is merge sort better than quick?
How efficient is bubble sort?
How would you sort words in a large file?
What is bubble sort technique?
Why is quicksort so fast?
How many types of data structure are there?
Why sorting is used?
What are different types of sorting algorithms?
What is insertion sort technique?
What does the dummy header in the linked list contain?
What is a map in programming?
How many parts are there in a declaration statement using data structures?
What is map entry?
How do you assign an address to an element of a pointer array ?
What is difference between hashmap and map?
