從尾到頭打印鏈表

題目：創建一個鏈表，從尾到頭打印鏈表。

三種方法：利用棧， 遞歸， 就地逆置

#include <iostream>
#include <stack>

using namespace std;

template <class T>
struct Node 
{
	T data;

	Node<T> *next;
};

template <class T>
void Create(Node<T>* &head, T a[], int n)
{
	Node<T> *s, *p;

	int flag = 1; //標記頭結點

	for (int i=0; i<n; i++)
	{
		s = new Node<T>;

		s->data = a[i];

		if (flag)
		{
			head = s;
			flag = 0;
			p = s;
		}
		else
		{
			p->next = s;
			p = s;
		}
	}

	p->next = NULL;
}

template <class T>
void Reverse1(Node<T> *head)  //先遍歷鏈表將元素存入棧，再輸出
{
	stack<T> s;

	while(head)
	{
		s.push(head->data);

		head = head->next;
	}

	while(!s.empty())
	{
		cout << s.top() << " ";

		s.pop();
	}
}


template <class T>
void Reverse2(Node<T> *head)  //遞歸
{
	if (head)
	{
		Reverse2(head->next);

		cout << head->data << " ";
	}
}

template <class T>
void Reverse3(Node<T>* &head)  //就地逆置鏈表(破壞了鏈表結構)
{
	Node<T> *q = NULL, *p = head, *s = head;

	while (s)
	{
		s = s->next;
		p->next = q;
		q = p;
		p = s;
	}

	head = q;
}

template <class T>
void Show(Node<T> *head)
{
	while (head)
	{
		cout << head->data << " ";

		head = head->next;
	}
}

template <class T>
void Release(Node<T> *head)
{
	Node<T> *p;

	while(head)
	{
		p = head;

		head = head->next;

		delete p;
	}
}
int main ()
{
	int a[] = {0, 1, 2, 3, 4, 5, 6};
	
	int n = sizeof(a)/sizeof(int);

	Node<int> *head = NULL;

	Create(head, a, n);

	Reverse1(head);
	Reverse2(head);
	Reverse3(head);

	Show(head);

	Release(head);

	return 0;
};