Resizable and Growable Data Structure are there in Array List.

Dublicates are allowed.

– Insertion order is preserved, hettrogenous and homogeneous object are allowed ( aceapt Tree Set & Tree Map)

Null insertion is possible

new capacity = ( CurrentCapacity * 3/2)+1)

– Array list is implemented with serializable and clonable .

Implemented by Random Access Interface ( This is a marker interface in java.util package)

Best choice for retrieval operations because of Random Access Interface (I) . Wrost choice is insertion and deletion in the middle.


Leave a comment

Design a site like this with WordPress.com
Get started