Method print

12_LinkedList.java/DoubleLL.java:32–39

()

    //print
    public void print() {
        Node temp = head;
        while(temp != null) {
            System.out.print(temp.data +"<->");
            temp = temp.next;
        }
        System.out.println("null");
    }

    //remove - removeLast
    public int removeFirst() {