What is the difference between arraylist and linkedlist?
- 1 Answers
- 1102 Views
- I also Faced
- E-Mail Answers
Answer / Ramesh Rastogi
ArrayList is a resizable-array data structure that implements the List interface in Java. It maintains elements in contiguous memory locations, ensuring fast read and write operations. On the other hand, LinkedList is a doubly-linked list data structure that also implements the List interface. Its nodes are linked using pointers which makes insertion and deletion of elements faster compared to ArrayList but slower for accessing elements due to random access time complexity.
| Is This Answer Correct ? | 0 Yes | 0 No |
How do you declare An array of three char pointers
What is advantage and disadvantage of linked list?
What is the difference between ienumerable and list?
Can you provide some implementation of a dictionary having large number of words?
What does isempty() member method determines?
Which sort is best for linked list?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
What do you mean by garbage collection?
What are different techniques for making hash function?
Can arraylist have null values?
How to cut or remove an element from the array?
Can a hashmap have duplicate keys?
Windows 
