public Node find(int id) {
        Node current = root;
        while (current.id != id) {
            if (id < current.id)
                current = current.leftChild;
            else
                current = current.rightChild;
            if (current == null)
                return null;
        }
        return current;
    }