OneWayLinkedList.h

/*
 * @Name: One Way Linked List C++
 * @Author: Max Base
 * @Date: 2022-11-14
 * @Repository: https://github.com/basemax/OneWayLinkedListCpp
 */

class Node {
public:
    int data; // Data
    Node* next; // Pointer to next node

    // Node Constructor
    Node(int data);
};

class OneWayLinkedList {
private:
    Node* head; // Pointer to head node
    Node* tail; // Pointer to tail node and Tail is the last node in the list.
    int size; // Size of list
public:
    // OneWayLinkedList Constructor
    OneWayLinkedList();

    // Add new node to the beginning of the list
    void addBegin(int data);

    // Add new node to the end of the list
    void addEnd(int data);

    // Deep copy
    OneWayLinkedList* deepCopy();

    // Deep copy nodes
    Node* deepCopyNodes();

    // Print all nodes
    void print();

    // Delete all nodes
    void deleteAll();

    // Support delete operator
    // ~OneWayLinkedList();

    // Check has a node with a specific data in the list or not
    bool has(int data);

    // Get the size of the list
    int getSize();
    
    // Get the node by searching with data
    Node* getNode(int data);

    // Check there is a node with a specific data in the list or not
    int hasNode(int data);

    // Check there is a node with a specific data in the list or not (with a recursive function)
    int hasNodeRecursive(int data, Node* node);

    // Maloc a new node
    Node* mallocNode(int data);

    // Delete a node with a specific data
    void deleteNode(int data);

    // Get the node by searching with index
    Node* getNodeByIndex(int index);

    // Delete a node after a node with a specific index
    void deleteNodeAfterIndex(int index);

    // Delete a node before a node with a specific data
    void deleteNodeBeforeData(int data);

    // Delete a node with a specific index
    void deleteNodeByIndex(int index);

    // Delete a node after a node with a specific index
    void deleteNodeAfterData(int data);

    // Delete a node before a node with a specific index
    void deleteNodeBeforeIndex(int index);

    // Count number of nodes
    int count();

    // Count number of nodes with a recursive function
    int countRecursive(Node* node);

    // Get the first node
    Node* getFirstNode();

    // Get the last node
    Node* getLastNode();

    // Reverse the list
    void reverse();

    // Reverse the list with a recursive function
    void reverseRecursive(Node* node);

    // Get the middle node
    Node* getMiddleNode();
};