链表 C++

Question

I have to ADD a node to the end of a Linked LIST, it's not throwing any errors so far, but apparently it's not working too. I've looked into others answers, but couldn't see what's wrong with mine. I think that the problem might be with getNext() and NULLs. ps: I'm using HPP

Here's the method :

// ADD a node to the end of the Linked list
void add(const T& dado)
{
    Elemento < T > *novo = new Elemento<T>(dado, NULL);
    if (novo == NULL)
    {
        throw 2;
    }
    if (head->getNext() != NULL)
    {
        Elemento < T > *auxi = new Elemento<T>(dado, head->getNext());
        int i;
        for (i = 0; auxi->getNext() == NULL; i++)
        {
            auxi->setNext(auxi->getNext());
            if (auxi->getNext()() == NULL)
            {
                size++;
                auxi->setNext(novo);
            }
        }
    }
    else
    {
        size++;
        head->setNext(novo);
    }
}

My elemento class is as follow:

#ifndef ELEMENTO_HPP
#define ELEMENTO_HPP

template<typename T>
class Elemento {
 private:
    T *info;
    Elemento<T>* _next;

 public:
    Elemento(const T& info, Elemento<T>* next) : info(new T(info)), _next(next) {}

    ~Elemento() {
        delete info;
    }

    Elemento<T>* getNext() const     {
        return _next;
    }

    T getInfo() const {
        return *info;
    }

    void setNext(Elemento<T>* next) {
        _next = next;
    }
};

#endif

You can see the whole code here: http://pastebin.com/7yJfsK8j (method names in Portuguese, but there are comments to explain).

Answer 1

Try this for-loop:

Elemento<T> *ptr;

//Will iterate until ptr-> getNext() is null (this means ptr is not null).
for(ptr = head; ptr -> getNext() != NULL; ptr = ptr -> getNext())
{
   //Does nothing.
};
ptr -> setNext(novo);

size++;

Hope it works!