Why is it difficult to store linked list in an array?
- 6 Answers
- 22017 Views
- Infosys, Lucent, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / deepti
because in linklist we can store as many elements as we
want because size does not matter .but in case of array if
we define size suppose 20 we can store only 20 elements .
| Is This Answer Correct ? | 20 Yes | 2 No |
Answer / maria
Because of defragmentation, when node should be deleted.
| Is This Answer Correct ? | 15 Yes | 2 No |
Answer / sandy
because it grows dynamically. it can get extra node from
avail(available) list whereever array not having any avail
list......
| Is This Answer Correct ? | 6 Yes | 0 No |
Answer /
array can grow dynamically...........
but it is a waste of memory to set them to grow dynamically
| Is This Answer Correct ? | 2 Yes | 14 No |
How the compilers arranges the various sections in the executable image?
How to avoid changing constant values?
What causes a runtime error c++?
Evaluate the following expression as C++ would do :8 * 9 + 2 * 5 a) 82 b) 79 c) 370 d) list
What are the basic data types used in c++?
How long does it take to get good at leetcode?
What is an undefined behavior and sequence points
Explain about Virtual Function in C++?
What do you mean by vtable and vptr in c++?
You have to take 2 arrays of length 10. Input the values of array 1 from the user. Then copy the values of array 1 to array 2 in ascending order For example if user enters 9, 5, 6, 8, 1, 0, 2, 7, 4, 3 then copy the smallest element i.e. 0 first followed by 1, 2 and so
How do you traverse a btree in backward in-order?
What does scope resolution operator do?
STL 
