递归算法流程图(递归算法流程图解) void Insert(int x, Node *L, Node *P) { Node *TmpCell; TmpCell = ( Node *)malloc( sizeof( struct Node ) ); if( TmpCell == NULL ) { printf( \"Out of space!!!\" ); } TmpCell->a = x; TmpCell->next = P->next; P->next = TmpCell; }