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 priority queue in data structure?
Why linked list is required?
What is the use of placement new?
What is sorting rule in shapes?
Define left-in threaded tree?
What is the heap in data structures?
What is peek in stack?
How do I start preparing for placement?
Is Arraylist faster than Array? Why?
What are the scenarios in which an element can be inserted into the circular queue?
What are the advantages of stack?
Which data structure is used to perform recursion?
Differentiate between push and pop?
How many null values are allowed in hashmap?
What is unmodifiable list?
