T get(int index) {
        cout << "get " << index;
        if (qsize == 0)
            return NULL;
        if (index < 0 || index >= qsize)
            return NULL;
        cout << " qsize: " << qsize << "\n";
        int i = 0;
        Node* tmp = start;
        while (i++ < index) {
            tmp = tmp->next;
        }
        return *(tmp->el);
    }