Implementation of stack with java. Hoping to push golang with this understanding soon.

Stack.java

public class Stack{

    private Node head;

    //I Prefer this to having to walk the length of the stack everytime.
    private int length=0;


    //In case there is a node to be initialized with this stack. hence this constructor.
    public Stack(Node head){
        this.head=head;
    }

    public Stack(){
        this.head=null;
    }

    public void printStack(){
        Node n = head;

        while(n!=null){
            System.out.println(n.data+"");
            n=n.next;
        }
    }

    public void push(int item){
        Node newItem=new Node(item);
        newItem.next=head;
        head=newItem;
        this.length++;
    }


    public Node pop(){
        Node currentItem=head;
        head=head.next;
        this.length--;
        return currentItem;
    }

    public Node top(){
        return this.head;
    }

    public int getLength(){
        return this.length;
    }
}