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
Why is bubble sort stable?
What is advantage and disadvantage of linked list?
How is heap sort implemented?
What is a threaded binary tree? Explain its operation with example?
How do you find the index of an element in an arraylist?
Explain linked list in short.
What is the difference between hashset and linkedhashset?
How do you perform a merge sort?
Why is it called bubble sort?
What is the difference between hashset and hashmap?
Can we apply binary search algorithm to a sorted linked list, why?
What are the objectives of studying data structures?
How would you dynamically allocate a one-dimensional and two-dimensional array of integers?
How do I sort hashset?
Define tree edge?
