I would change your traverse function to be more like this:

public void traverse(){
  Node<T> pointer = head;

  while (pointer != null){
    System.out.println(pointer.getData());
    pointer = pointer.getLink();
  }
}

Also it is common to represent the Node class as a private inner class of LinkedList because it is not typically needed anywhere else.

As far as the interview itself goes, traversal questions are more typical for binary-trees (eg. print out the elements in sorted order). LinkedList questions are more focussed on the remove/insert operations which both require careful attention to the edge cases (what happens when you remove the head for example). A more advanced LinkedList question would ask how to detect a cycle, I would make sure that I knew at least one method of doing this (have a look at the Tortoise and the Hare algorithm).

EDIT:

Algorithm questions will nearly always be from the following list:

• String manipulation such as:
  • Reverse String
  • Count how many times each letter appears in a given String (use a Map for this)
• LinkedList questions such as:
  • How to remove a node, pay close attention to edge cases such as removing the head
  • How to reverse a linkedList (make the Tail the Head)
• Binary Tree questions such as:
  • In-order traversal
  • If there is a BTree balancing question you won't need to implement it, just understand that a completely unbalanced Binary Tree is simply a Linked List.
  • Understand that searching a balanced Binary Tree is O(log n) compared to a Linked List or a completely unbalanced Binary Tree which is O(n).
• You will probably be asked to describe the complexity of the solution you just gave (big-O notation)

See this and this for questions related to Java itself

I found 5 main ways to iterate over a Linked List in Java (including the Java 8 way):

1. For Loop
2. Enhanced For Loop
3. While Loop
4. Iterator
5. Collections’s stream() util (Java8)

For loop

LinkedList<String> linkedList = new LinkedList<>();
System.out.println("==> For Loop Example.");
for (int i = 0; i < linkedList.size(); i++) {
    System.out.println(linkedList.get(i));
}

Enhanced for loop

for (String temp : linkedList) {
    System.out.println(temp);
}

While loop

int i = 0;
while (i < linkedList.size()) {
    System.out.println(linkedList.get(i));
    i++;
}

Iterator

Iterator<String> iterator = linkedList.iterator();
while (iterator.hasNext()) {
    System.out.println(iterator.next()); 
}

collection stream() util (Java 8)

linkedList.forEach((temp) -> {
    System.out.println(temp);
});

One thing should be pointed out is that the running time of For Loop or While Loop is O(n square) because get(i) operation takes O(n) time(see this for details). The other 3 ways take linear time and performs better.