what is the difference between linked list and array list while operating

Question

c use pointer then does java use the similar way to make the linked list

Answer 1

You can also have a look at my codes.
"Self implemented LinkedList" shows an example of a LinkedList implementation.

Answer 2

All linked lists are based on pointers, a doubly-linked list has two pointers, one for the previous element and one for the next. So to find an element you have to go through the pointers which is a litte slow (linear time), but when you insert or delete an element you only change 2 pointers. This can be done in constant time which means it is very fast.
An array list is basically a dynamic array, which means it can be indexed in constant time, but when it grows it uses memory copy operations when its buffer is full. This can take a lot of time.