struct node {
	int data;
	struct node* next;
};

int mid_element ( struct node* _node )
{
	struct node* cur_ptr;
	struct node* cur_next_ptr;

	if ( NULL == _node ) return ( -1 );
	else {
		cur_ptr = _node;
		cur_next_ptr = _node;
		while ( ( NULL != cur_ptr -> next ) 
				&& ( NULL != cur_next_ptr -
> next ) 
				&& ( NULL != cur_next_ptr -
> next -> next ) )
		{
			cur_ptr = cur_ptr -> next;
			cur_next_ptr = cur_next_ptr -> 
next -> next;
		}
	}

	return ( cur_ptr -> data );
}

NODE display_middle(NODE first)
{
	int count = 0;
	NODE  temp,mid;
	
	for ( temp = mid = first, count=0; temp ; temp = temp ->
link,count++)

	{
		if ( count % 2 )
		{
			mid = mid -> link;
		}
	}
	return mid;
}