find the largest node in a linked list in php

main.php
class Node {
    public $data;
    public $next;

    function __construct($data) {
        $this->data = $data;
        $this->next = null;
    }
}

class LinkedList {
    public $head;

    function __construct() {
        $this->head = null;
    }

    function add($data) {
        $node = new Node($data);

        if ($this->head == null) {
            $this->head = $node;
        } else {
            $current = $this->head;
            while ($current->next != null) {
                $current = $current->next;
            }
            $current->next = $node;
        }
    }

    function findMax() {
        $max = null;
        $current = $this->head;

        while ($current != null) {
            if ($max == null || $current->data > $max) {
                $max = $current->data;
            }
            $current = $current->next;
        }

        return $max;
    }
}

// Example usage
$list = new LinkedList();
$list->add(5);
$list->add(10);
$list->add(3);
$list->add(8);
echo $list->findMax(); // Output: 10
1033 chars
54 lines