103. Linked List

struct Node
{
    int value;
    Node *next;
};

struct Node
{
    int value;
    Node *prev, *next;
};

class Node
{
private:
    int value;
    Node* nextPtr;
public:
    Node(int val)
        : value(val), nextPtr(nullptr) {}

    void Insert(Node* newNext)
    {
        if (nextPtr != nullptr)
            newNext->nextPtr = nextPtr;
        else
            newNext->nextPtr = nullptr;

        nextPtr = newNext;
    }

    Node* Find(int value)
    {   
        for (auto ptr = this; ptr != nullptr ; ptr = ptr->nextPtr)
        {
            std::cout << "Find Logger : " << ptr->value << std::endl;
            if (ptr->value == value)
                return ptr;
        }
        return nullptr;     
    }
};

int main(int argc, char** argv)
{
    Node headNode(4);

    headNode.Insert(new Node(20));
    headNode.Insert(new Node(23));
    headNode.Insert(new Node(12));

    if (headNode.Find(20) == nullptr)
        std::cout << "Success." << std::endl;
    else
        std::cout << "Fail." << std::endl;

    return 0;
}