Graf - Lista sąsiedztwa po mojemu v2

#include <iostream>

using namespace std;

class AdjNode {
private:
    int nodeNo;
    AdjNode* next;
public:
    AdjNode();
    AdjNode(int u, AdjNode* n);
    int GetNode();
    AdjNode* GetNext();
    void insertAdjNode(int u);
    void deleteAdjNode(int u);
    friend ostream& operator<<(ostream& out, AdjNode* node);
};

AdjNode::AdjNode() {
    nodeNo = -1;
    next = NULL;
}

AdjNode::AdjNode(int u, AdjNode* n) {
    nodeNo = u;
    next = n;
}

int AdjNode::GetNode() {
    return nodeNo;
}

AdjNode* AdjNode::GetNext() {
    return next;
}

void AdjNode::insertAdjNode(int u) {

    if (this->nodeNo == u)
        return;

    AdjNode* temp = this->next;
    AdjNode* prevTemp = NULL;

    if (temp == NULL) {
        temp = new AdjNode(u, NULL);
        this->next = temp;
        return;
    }
    if (temp->next == NULL) {
        AdjNode* newNode = new AdjNode(u, NULL);
        temp->next = newNode;
        return;
    }
    while (temp->next->nodeNo <= u) {
        if (temp->next->nodeNo == u) {
            return;
        }
        if (temp->next == NULL) {
            AdjNode* newNode = new AdjNode(u, NULL);
            temp->next = newNode;
            return;
        }
        prevTemp = temp;
        temp = temp->next;
        if (temp->next == NULL) {
            break;
        }
    }
    AdjNode* newNode = new AdjNode(u, temp->next);
    temp->next = newNode;
}

void AdjNode::deleteAdjNode(int u) {
    if (this->nodeNo == u)
        return;

    AdjNode* temp = this->next;
    AdjNode* prevTemp = NULL;

    if (temp == NULL)
        return;

    while (temp->nodeNo != u) {
        prevTemp = temp;
        temp = temp->next;
        if (temp == NULL)
            return;
    }
    if(prevTemp != NULL)
        prevTemp->next = temp->next;
    this->next = temp->next;

    delete temp;
}

ostream& operator<<(ostream& out, AdjNode* node) {
    if (node->GetNext() == NULL)
        return out;

    AdjNode* temp = node->GetNext();
    out << node->GetNode() << ": ";
    bool lolz1337 = true;
    while (temp != NULL) {
        if (!lolz1337)
            out << ", ";
        out << temp->GetNode();
        temp = temp->GetNext();
        lolz1337 = false;
    }
    return out;
}

class AdjList {
private:
    AdjNode** nodes;
    int amountOfNodes;
public:
    AdjList();
    AdjList(int c);
    void insertAdjNode(int primeNode, int secNode);
    friend ostream& operator<<(ostream& out, AdjList* graph);
};

AdjList::AdjList() {
    nodes = NULL;
    amountOfNodes = 0;
}

AdjList::AdjList(int c) {
    nodes = new AdjNode*[c];
    amountOfNodes = c;
    for (int i = 0; i < amountOfNodes; i++) {
        nodes[i] = new AdjNode(i, NULL);
    }

}

void AdjList::insertAdjNode(int primeNode, int secNode) {
    if (primeNode >= amountOfNodes)
        return;
    nodes[primeNode]->insertAdjNode(secNode);
}

ostream& operator<<(ostream& out, AdjList* graph) {
    if (graph->amountOfNodes == 0)
        return out;

    for (int i = 0; i < graph->amountOfNodes; i++) {
        out << graph->nodes[i] << endl;
    }
    return out;
}

int main() {

    AdjList* graf = new AdjList(5);

    graf->insertAdjNode(0, 1);
    graf->insertAdjNode(0, 3);
    graf->insertAdjNode(1, 3);
    graf->insertAdjNode(1, 2);
    graf->insertAdjNode(2, 4);
    graf->insertAdjNode(2, 0);
    graf->insertAdjNode(3, 2);
    graf->insertAdjNode(3, 4);
    graf->insertAdjNode(4, 0);

    cout << graf;


    /*
    AdjNode* node1 = new AdjNode(1, NULL);
    AdjNode* node2 = new AdjNode(2, NULL);
    AdjNode* node3 = new AdjNode(3, NULL);
    AdjNode* node4 = new AdjNode(4, NULL);
    AdjNode* node5 = new AdjNode(5, NULL);

    node1->insertAdjNode(2);
    node1->insertAdjNode(5);
    node2->insertAdjNode(4);
    node2->insertAdjNode(3);
    node3->insertAdjNode(5);
    node3->insertAdjNode(1);
    node4->insertAdjNode(3);
    node4->insertAdjNode(5);
    node5->insertAdjNode(1);


    cout << node1 << endl;
    cout << node2 << endl;
    cout << node3 << endl;
    cout << node4 << endl;
    cout << node5 << endl;
    */
    return 0;
}