Is array list better or link list in terms of memory requirement?

Answer 1

Because linked list has pointers to both previous and next elements as well as current element.

Answer 2

What Snehal said. ArrayList uses about 4 times less data per value. Something like 4-6 bytes per value whereas linked list is 24bytes. There are ways to trim it down, but ArrayList is hands down the winner.

Answer 3

here you can find what is the disadvantage of linked list: https://www.cs.cmu.edu/~adamchik/15-121/lectures/Linked%20Lists/linked%20lists.html

Answer 4

arraylist

Answer 5

Why link list uses more memory?

Answer 6

why array is arrayList??

Answer 7

jgdfgttfrddddddfgjjuuhggfddtgggfeedgjjgfdffghhshhhshhsiiwsvhehheehauauaahahhjejeoskjajhahahahajshashjnsevrysyysysyvvevgdqjkapmshsuwiwjjajhsysysjjwnnssuusukfkkrnrbrvvrbrnrnrmrkfkfkf