Thread: Here's a problem, any one helps me?

The insert and find function, copied from my textbook:

Code:

SearchTree
Insert( ElementType X, SearchTree T )
{
  /* 1*/      if( T == NULL )
    {
      /* Create and return a one-node tree */
      /* 2*/          T = malloc( sizeof( struct TreeNode ) );
      /* 3*/          if( T == NULL )
	/* 4*/              FatalError( "Out of space!!!" );
      else
	{
	  /* 5*/              T->Element = X;
	  /* 6*/              T->Left = T->Right = NULL;
	}
    }
  else
    /* 7*/      if( X < T->Element )
      /* 8*/          T->Left = Insert( X, T->Left );
    else
      /* 9*/      if( X > T->Element )
	/*10*/          T->Right = Insert( X, T->Right );
  /* Else X is in the tree already; we'll do nothing */
  
  /*11*/      return T;  /* Do not forget this line!! */
}
/* END */


Position
Find( ElementType X, SearchTree T )
{
  if( T == NULL )
    return NULL;
  if( X < T->Element )
    return Find( X, T->Left );
  else
    if( X > T->Element )
      return Find( X, T->Right );
    else
      return T;
}

It seems the probelm happened in this two lines

Code:

Insert(num, T);    
P = Find(num, T);

because the printf statment after the two is not working.

O....no
I chaged the statment into T = Insert(num, T);
but still not works, this goddam thing almost make me mad.

Now I am sure that the problem is in the Insert function, but why?
I just copy it from my textbook. O...god, if I cannot find it, I will die.

Code:

SearchTree
Insert( ElementType X, SearchTree T )
{
  /* 1*/      if( T == NULL )
    {
      /* Create and return a one-node tree */
      /* 2*/          T = malloc( sizeof( struct TreeNode ) );
      /* 3*/          if( T == NULL )
	/* 4*/              FatalError( "Out of space!!!" );
      else
	{
	  /* 5*/              T->Element = X;
	  /* 6*/              T->Left = T->Right = NULL;
	}
    }
  else
    /* 7*/      if( X < T->Element )
      /* 8*/          T->Left = Insert( X, T->Left );
    else
      /* 9*/      if( X > T->Element )
	/*10*/          T->Right = Insert( X, T->Right );
  /* Else X is in the tree already; we'll do nothing */
  
  /*11*/      return T;  /* Do not forget this line!! */
}
/* END */

yes, you r right, I found it in my textbook as soon as you post it on!