They'll probably be more interested in if you understand what a stack/linked list is, how they work, and so on. Basically, could you implement one in C, C++ if you had to do it, assuming you knew the language? If those things are a standard part of the languages you listed, you probably wouldn't be asked to implement them in a raw way.
But like I mentioned, they'll want you to prove that you understand the logical concepts behind the data structures if the question is coming up. For example in answering the question on stacks, stacks are LIFO structures, where what you add last is taken off first. It's like a stack of plates where you can only add or remove the top plate. Then if you go into implementation, you simply take an array of a certain size, keep track of the capacity, and only operate off of that index value. For instance, Delphi/Pascal implementation:
const
maxstacksize = 500;
type
TIntegerStack = class
private
elements: array[1..maxstacksize] of integer;
capacity: integer;
public
procedure place(element: integer);
function remove: integer;
end;
procedure TIntegerStack.place(element: integer);
begin
if capacity = maxstacksize then
// error, trying to place element on full stack, i.e. stack overflow
else
begin
inc(capacity);
elements[capacity] := element;
end;
end;
function TIntegerStack.remove: integer;
begin
Result := -1;
if capacity = 0 then
// error, trying to remove element from empty stack
else
begin
Result := elements[capacity];
dec(capacity);
end;
end;
Most interviewers probably won't need you to take it that far to prove you know what stacks are and how they work, but it gives you an idea of what the interviewer is expecting.
