linked list help C++

#include <iostream>
using namespace std;
template<class T>class LinkedList
{
    public: T* current;
    public: LinkedList* next = NULL;
    public: LinkedList* prev = NULL;
    private: long long CountFirst()
    {
        if (prev == NULL)
        {
            return 0;
        }
        long long answer = (prev == NULL)?0:prev->prev->CountFirst();
        return answer;
    }

    public: long long Count()
    {
        if (next == NULL)
        {
            return 0;
        }
        long long answer = CountFirst();
        answer += (current == NULL)?0:1;
        answer += (next == NULL)?0:next->Count();
        return answer;
    }
    public: T* Find()
    {

    }
    public: T& operator[](int index)
    {
        if (next == NULL and current != NULL)
        {
            return *current;
        }
        if (prev->Count() - 1 > index)
        {
            return *prev[index].current;
        }
        if (prev->Count() == index)
        {
            return *current;
        }
        return *next[index - prev->Count()].current;
    }
    public: void Add(T ForAdd, int pos)
    {
        cout << "ADD";
        ((*this)[pos - 1]) = (*this)[pos];
        cout << "ADD";
        ((*this)[pos]) = (*this)[pos - 1];
        cout << "ADD";
        ((*this)[pos]) = (*this)[pos + 1];
        cout << "ADD";
        ((*this)[pos + 1]) = (*this)[pos];
        cout << "ADD";
        ((*this)[pos]) = &ForAdd;//crash
        cout << "ADD";
    }
    public: void Delete(int pos)
    {
        (*this)[pos - 1] = (*this)[pos + 1];
        (*this)[pos + 1] = (*this)[pos - 1];
    }
};