Source.cpp

#include <iostream>
#include <algorithm> //fill, copy
#include "Node.h"
using namespace std;



void printList(Node * pHead);
void addListHead(const DataType &data, Node*& pHead);
void addlist(const DataType &data, Node* pCurrent);
Node* findInList(const DataType& data, Node* start);
void delListHead(Node*& pHead);
void delListNode(Node* pRrew);
int main()
{

    Node * pHead = new Node(1);
    pHead->setpNext(new Node(3));
    printList(pHead);

    addListHead(0, pHead);
    //printList(pHead);
    Node* pCurrent = pHead->detpNext();
    addlist(2, pCurrent);
    printList(pHead);
//  addlist(5, pCurrent);
    //printList(pHead);
    cout << findInList(3, pHead)<<endl;
    cout << findInList(8, pHead) << endl;
    addlist(4, findInList(3, pHead));
    printList(pHead);
    delListHead(pHead);
    printList(pHead);
    delListNode(findInList(2, pHead));
    printList(pHead);
    /*Node k1;
    cout << "getData() = " << k1.getData() << endl;
    cout << "getpNext() = " << k1.detpNext() << endl;
    cout << "Enter data: ";
    DataType value;
    cin >> value;
    k1.setData(value);
    cout << "New getData() for K1 = " << k1.getData() << endl;*/

    system("pause");
    return 0;
}
void printList(Node * pHead)
{
    for (Node*pCurrent = pHead; pCurrent != nullptr; pCurrent = pCurrent->detpNext())
    {
        cout << pCurrent->getData() << endl;
    }
}
void addListHead( const DataType &data, Node*& pHead)
{
    Node* pNew = new Node;
    pNew->setData(data);
    pNew->setpNext(pHead);
    pHead = pNew;
}
void addlist(const DataType & data, Node* pCurrent)
{
    Node * pNew = new Node(data, pCurrent->detpNext());
    pCurrent->setpNext(pNew);
}

Node* findInList(const DataType& data, Node* start)
{
    for (Node* pCurrent = start; pCurrent != nullptr;pCurrent=pCurrent->detpNext())

    {
        if (pCurrent->getData() == data)
            return pCurrent;
    }
    return nullptr;
}
void delListHead(Node*& pHead)
{
    Node*pDel = pHead;
    pHead = pHead->detpNext();
    delete pDel;
}

void delListNode(Node* pRrew)
{
    Node*pDel = pRrew->detpNext();
    pRrew->setpNext(pDel->detpNext());
    delete pDel;
}