Through traversal, find the last node in the linked list

Through traversal, find the last node in the
linked list First create a linked list, and then find the last node of the linked list
Code example:

class Node {
    
    
    public int val;
    public Node next;

    public Node(int val) {
    
    
        this.val = val;
    }
}
public  class MyLinkedList {
    
    

    public Node head;//普通引用，目的是让head一直指向当前列表的头

    public void createLinked() {
    
    
        this.head = new Node(12);
        Node node2 = new Node(22);
        Node node3 = new Node(32);
        Node node4 = new Node(42);
        head.next = node2;
        node2.next = node3;
        node3.next = node4;
    }

    public void display() {
    
    
        Node cur = this.head;
        while (cur != null) {
    
    
            System.out.print (cur.val +" ");
            cur = cur.next;
        }
        System.out.println();
    }
   public  Node findLastNode() {
    
    
       Node cur = this.head;
       while (cur.next != null) {
    
    
           cur = cur.next;
       }
       return cur;
   }
    public static void main(String[] args) {
    
    
        MyLinkedList myLinkedList = new MyLinkedList();
        myLinkedList.createLinked();
        myLinkedList.display();
        Node ret = myLinkedList.findLastNode();
        System.out.println(ret.val);
    }

result: