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
Is complete binary tree?
In tree construction which is the suitable efficient data structure?
What does it mean to sort an array?
What is time complexity of binary search?
What is stack in geography?
In Data Structure, write output of given program.
What do you mean by breadth first search (bfs)?
What are different types of linked lists?
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
What are the applications of b-tree?
What are linked lists most commonly used for?
Write the disadvantages of separate chaining?
Which is faster array or arraylist?
What is an ordered map?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
