Find length of the linked list

Input: head=[1, 2, 8, 3, 7, 0, 4]
Output : 7
Explanation: Given linkedlist has 7 nodes

class Solution {

	public int size(ListNode head) {
		// Base case: if the head is null, return 0
		if (head == null) {
			return 0;
		}
		// Recursive case: 1 + length of the rest of the list
		return 1 + size(head.next);
	}
}

class Solution {

	public int size(ListNode head) {
		int length = 0;
		ListNode current = head;

		while (current != null) {
			length++;
			current = current.next;
		}

		return length;
	}
}