2-связный список на основе указателей next и pred

#include "iostream"
#include "conio.h"
#include "stdlib.h"
using namespace std;
 
struct Item
{
    int data;
    Item *pred, *next;
}
typedef Item, *Point;
 
class List
{
private:
    Point First, p, n;
    int a, d, min, position, tmp, k;
public:
    List ();
    Point create ();
    void AddEl (int position);
    int SearchMinEl ();
};
 
List::List ()
{
    tmp = 1;
}
 
Point List::create()
{
    First = Point (malloc (sizeof (Item)));
    cout<<"Enter first element:"<<endl;
    cin>>First->data;
    First->next = NULL;
    First->pred = NULL;
    return First;
}
 
void List::AddEl(int position)
{
    n = Point(malloc (sizeof (Item)));
    p = First;
    while (p->next != NULL) tmp++;
    if ((tmp+1) != position) cout<<"Error"<<endl;
    else
    {
        if (position == 1) 
        {
            n->next = First;
            First->pred = n;
            First = n;
        }
            else
            {
                cout<<"Enter next element:"<<endl;
                cin>>n->data;
                tmp = 1;
                while (tmp != position-1) { tmp++; p = p->next; }
                n->next = p->next;
                n->pred = p;
                p->next = n;
            }
    }
}
 
 
int List::SearchMinEl()
{
    min = First->data;
    p = First;
    do
    {
        if (p->data < min) min = p->data;
        p = p->next;
    } while (p->next != NULL);
    return min;
}
 
void main ()
{
    List A;
    char ch;
    int position,q;
    
    A.create ();
    cout<<"Enter position:"<<endl;
    cin>>position;
    A.AddEl (position);
    cout<<"Min element:"<<endl<<A.SearchMinEl();
_getch ();
}

    First = Point (malloc (sizeof (Item)));

    First = (Point) malloc(sizeof(Item));

int List::SearchMinEl()
{
        min = First->data;
        p = First;
        while (p->next != NULL)
        {
            p = p->next;                
            if (p->data < min) min = p->data;
        } ;
        return min;
}