check my code Please

#include <iostream>
#include<string>
using namespace std ;
struct NodeType 
{
	string Name ;
	int Grade ;
	NodeType *Link ;
};
class TotalLinkedList 
{
private :
	NodeType *Pass ;
	NodeType *Fail ;
	int CountPass ;
	int CountFail ;

public :
	void insert (string , int ) ;
	void deleteNode (int);
	int searchName(string);
	string FindMax () ;
	double PrintAverage ();
	void Print();
	TotalLinkedList ();
	~TotalLinkedList();
	TotalLinkedList (TotalLinkedList&);
};
TotalLinkedList::TotalLinkedList() 
{
	Pass = 0 ;
	Fail = 0 ;
	CountPass =0 ;
	CountFail = 0; 
}
void TotalLinkedList::insert (string name ,int grade )
{
  NodeType *P ,*F , *C=new NodeType , *D=new NodeType ;
  P=new NodeType ;
  F= new NodeType ;
 
  if (grade >=50&&grade<=100 )
  {
	  if (Pass==0)
		  Pass=P;
       P->Grade = grade ;
	   P->Name=name ;
	   P->Link = Pass ;
	  P->Link =Pass ;
	  CountPass++ ;
      for ( int i=0 ; i<countpass mode="hold" />	  { 
		  C=C->Link ;
		  C->Link =P ;
		  P->Link = Pass ;
		  Pass = P ; }}
  else 
	 
	  if (grade <=50 &&grade>0 )
  {
	  if (Fail==0)
		  Fail=F;
       F->Grade = grade ;
	   F->Name=name ;
	   F->Link = Fail ;
	  F->Link =Fail ;
	  CountFail++ ;
	  
	  C=0;

      for ( int i=0 ; i<countfail mode="hold" />	  { 
		  C=C->Link ;
		  C->Link =F ;
		  F->Link = Fail ;
		 Fail = F ; }}
	  else 
		  cout <<" Can not insert " << endl;

}
int TotalLinkedList::searchName(string name)
{

	for(int i=0 ; i<countpass;i++)>
	{
		if(Pass->Name==name)
			return Pass->Grade;
		else 
			if (Fail->Name==name)
				return Fail->Grade ;
	}
}
 
string TotalLinkedList:: FindMax () 
{
	 
	NodeType *C=Pass;
	int Max = Pass->Grade ;
	for (int i=0;i<countpass;i++)>
	{
		
		
		if (C->Grade>Max)
			Max=C->Grade;
		
		C=C->Link;
		
	}
	return C->Name ; 
}




double TotalLinkedList::PrintAverage ()
{
	int sum1=0,sum2=0 , SUM=0 , average;
	for (int i=0 ; i<countpass;i++)>
	{
		sum1=sum1 + Pass->Grade ;
	}
	for (int i=0 ; i<countfail;i++)>
	{
		sum2=sum2 + Fail->Grade ;
	}
	SUM=sum1+sum2;
		average = SUM/(CountPass+CountFail) ;
		return average ;
}
void TotalLinkedList::Print()
{
	NodeType *c ;
	c=Pass;
	for (int i =0 ;i<countpass;i++)>
	{
		cout << c->Name << " " << c->Grade ;
		c=c->Link ;
	}
	c=0;
	c=Fail;
	for (int i =0 ;i<countfail;i++)>
	{
		cout << c->Name << " " << c->Grade ;
		c=c->Link ;
	}

}
TotalLinkedList::~TotalLinkedList()
{
	delete Pass ;
	delete Fail ;

}

int main ()
{
	TotalLinkedList Obj1 ;
	Obj1.insert("Ali" , 90 );
	Obj1.insert("Rhmad" , 44 );
	Obj1.insert("Ruba" , 103 );
	Obj1.insert("Majd" , 77 );
	Obj1.insert("Huda" , 85 );
	Obj1.insert("Kamel" ,39 );
	Obj1.insert("Ola" , -5 );
	Obj1.insert("Eman" , 90 );
	

	return 0 ;
}