In context of java List is an interface and LinkedList is the implementing class of List(I). But doesn't seems to be like it was the question. i think its ArrayList v LinkedList? AL uses dynamic array LL uses doubly linked list concept AL implements RandomAcess(I) LL doesn't. AL have expensive deletion as compared to LL LL have expensive traversing as compared to AL