what is the difference between singly and doubly linked lists?
- 1 Answers
- 1086 Views
- I also Faced
- E-Mail Answers
Answer / Yogesh Pandey
The main difference between a singly linked list and a doubly linked list is that each node in a singly linked list has only one reference to the next node, while each node in a doubly linked list has references to both the next and previous nodes.
| Is This Answer Correct ? | 0 Yes | 0 No |
Define red-black trees.
Why do we need to use computers to help us sort lists?
What is data structure what is need of it?
Is map a collection?
What data structure does a binary tree degenerate?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential
What are data and data types?
Can a stack be described as a pointer? Explain.
What sort of serious problems have you experienced, and how have you handled them?
what is a balanced tree.
How do we find duplicate elements in an array?
Why is it called bubble sort?
Windows 
