{
Mark_Node_Pa = Mark_Node_P;
if (sc < Mark_Node_P->mark)
Mark_Node_P = Mark_Node_P->Lchild;
else
{
if (sc > Mark_Node_P->mark)
Mark_Node_P = Mark_Node_P->Rchild;
else
{
Student_Node_P = Mark_Node_P->Snext;
while ( Student_Node_P->next != NULL )
Student_Node_P = Student_Node_P->next;
Student_Node_P->next = Student_New;
Student_Node_P = Student_New;
break;
}
}
}
if (sc < Mark_Node_Pa->mark)
{
Mark_New = (Mark_link) malloc (sizeof (Node2) );
Mark_New->Lchild = Mark_New->Rchild = NULL;
Mark_New->Snext = NULL;
Mark_New->mark = sc;
Mark_New->Snext = Student_New;
Mark_Node_Pa->Lchild = Mark_New;
Mark_Node_Pa = Mark_New;
}
else
{
if (sc > Mark_Node_Pa->mark)
{
Mark_New = (Mark_link) malloc (sizeof (Node2) );
Mark_New->Lchild = Mark_New->Rchild = NULL;
Mark_New->Snext = NULL;
Mark_New->mark = sc;
Mark_New->Snext = Student_New;
Mark_Node_Pa->Rchild = Mark_New;
Mark_Node_Pa = Mark_New;
评论3
最新资源