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
When is a binary search algorithm best applied?
Can array store heterogeneous data?
What does stack top do?
Define the queue data structure.
How do you find the depth of a binary tree?
How does a heap sort work?
Which of the collections allows null as the key?
Is hashmap ordered?
Write is a binary search tree? Write an algorithm and tell complexity?
What is a string or array type?
How does insertion sort works?
Is treeset sorted?
Describe the types of data structures?
What is the default size of arraylist?
Which is faster quick sort or merge sort?
