linkedlist

//
//  main.cpp
//  LinkedList
//
//  Created by User on 15.10.2018.
//  Copyright © 2018 User. All rights reserved.
//

#include <iostream>
struct Node
{
    Node()
    {
        value=0;
        pPointer=0;
    }

    int value;
    Node *pPointer;
};
class LinkedList
{
public:
    LinkedList()
    {
        first_node = 0;
        last_node = 0;
    }
    ~LinkedList()
    {

    }
    void print_Node(Node* node)
    {
        Node* tmp = node;
        while(tmp->pPointer != 0)
        {
            std::cout<<tmp->value<<std::endl;
            tmp = tmp->pPointer;
        }
        std::cout<<tmp->value<<std::endl;
    }
    void addNodeStart(Node*& node ,int value)
    {
        Node* new_node = new Node;
        new_node->pPointer = node;
        new_node->value = value;
        node = new_node;
    }
    void addNodeEnd(Node*& last_node ,int value)
    {
        Node* new_node = new Node;
        last_node->pPointer = new_node;
        new_node->value = value;
    }
private:
    Node* first_node;
    Node* last_node;
};


/*void print_Node(Node* node)
{
    std::cout<<node->value<<std::endl;
    if(node->pPointer!=0)
    {

        node=node->pPointer;
        print_Node(node);
    }
}
void print_Node(Node* node)
{
    Node* tmp = node;
    while(tmp->pPointer != 0)
    {
        std::cout<<tmp->value<<std::endl;
        tmp = tmp->pPointer;
    }
    std::cout<<tmp->value<<std::endl;
}
void addNodeStart(Node*& node ,int value)
{
    Node* new_node = new Node;
    new_node->pPointer = node;
    new_node->value = value;
    node = new_node;
}
void addNodeEnd(Node*& last_node ,int value)
{
    Node* new_node = new Node;
    last_node->pPointer = new_node;
    new_node->value = value;
}
 */

int main(int argc, const char * argv[]) {
    Node* first_node = new Node;
    Node* last_node = first_node;
    //first_node->pPointer = new Node;

    first_node->value = 10;
    addNodeStart(first_node, 15);
    addNodeStart(first_node, 20);
    addNodeEnd(last_node, 20);
    print_Node(first_node);

    delete first_node;
    return 0;
}
//