Implementing List Data Structure in C++ [closed]

  abstract-data-type, arrays, c++, list, pointers

Can someone help me implement List Data Structure ( ADT) with the following operations:

get() =: return A[current];
update(x) =: A[current] = x;
length () =: return size;
back() =: current--;
start() =: current = 1;
end() =: current = size;
Next(), Remove () & Add()

Operations must be implemented using pointers not indexes (of arrays)

Source: Windows Questions C++