******** fig3.38 ********** /* Insert (after legal position p). Header implementation assumed */ void insert( element_type x, LIST L, position p ) { position tmp_cell; /*1*/ tmp_cell = cursor_new( ); /*2*/ if( tmp_cell == 0 ) /*3*/ fatal_error("Out of space!!!"); else { /*4*/ CURSOR_SPACE[tmp_cell].element = x; /*5*/ CURSOR_SPACE[tmp_cell].next = CURSOR_SPACE[p].next; /*6*/ CURSOR_SPACE[p].next = tmp_cell; } }