Answer Posted / yogesh l. sharma
there are main four type of linked list.
1)singly linked list.
2)singly circular linked list.
3)doubly linked list.
4)doubly circular linked list.
| Is This Answer Correct ? | 4 Yes | 0 No |
Post New Answer View All Answers
What are the average and worst time complexity in a sorted binary tree is
Do all declaration statements result in a fixed reservation in memory?
Can constructor be static?
Why do we need to recycle?
How can you insert a node at the end of linked list?
In what scenario, binary search can be used?
Why is hashmap faster than arraylist?
Is hashtable fail fast?
Why do we Use a Multidimensional Array?
How do you balance a tree?
How do treesets work internally?
How many sorting algorithms are there?
What will be the output of below code?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
What are the five examples of data?
