Node number = first; while (number != null) { if (number.data > a) { a = current.data; } number = number.next; } return a; } public int getMin() { Node number = first; while (number != null) { if (number.data < b) { b = number.data; } number = number.next; } return b; }