explain very clearly and do not copy from anywhere

In Java,

A Queue is an abstract data type (i.e. an interface) for a FIFO container / collection. A Stack is an abstract data type for a LIFO container. Each of these containers has an array-based implementation and a pointer-based implementation. What is one advantage of the pointer-based implementation? What is one advantage of the array-based implementation