How to keep track of last added element of Linked List using static pointer to Node?

Question

class Node{ public: int info; Node* link; static int count; static Node* endNode; Node(){ this->info = 0; this->link = NULL; if(count==0) endNode = this; else count++; } void insert(int x){ Node *p = new Node; p->info = x; p->link = NULL; endNode->link = p; endNode = p; }

Answer 1

The classic approach is to have the count and end pointer in the Linked List class:

class Linked_List
{
    int node_count;
    Node * p_head;
    Node * p_tail;
};

The p_tail member points to nullptr or the last (ending) node.

Moving the count member to a Linked_List class allows for different linked lists to have different node quantities.