倒着打印单链表

/* 16：倒着打印单链表 */
void Reverse_print_linked_list(single_list_node* head)
{
	single_list_node* p = head;
	stack* st = createStack();
	
	while(p != NULL)
	{
		push(st, p->data );
		p = p->next;
	}
	while(!StackIsEmpty(st))
	{
		printf("%d	",GetTop(st));
		pop(st);
	}
	printf("\n");
	
}