数据结构代码

# include <stdio.h>
# include <iostream>
using namespace std;
typedef int T;

class List{
	//类型成员，仅仅是一个类型而已
	struct Node{
		T data;
		Node* next;
		//T()  int()表示0
		Node(const T& d=T()):data(d),next(0){}
	};
	Node * head;  //头指针，用来保存头节点的地址
public:
	List():head(NULL){
	}
	//前插数据



	void push_front(const T& d){
		//动态的分配内存
		Node* p=new Node(d);
		p->next=head;
		head = p;
	}

	//遍历
	void  travel() const  
	{
		Node *p = head;
		while(p!=NULL)
		{
			cout<<p->data<<"";
			p=p->next;
			cout<<endl;
		}
		cout<<endl;
	}


	void clear(){
		//清空这个链表
		while(head!=NULL)
		{
			Node *p=head->next;
			delete head;   
			head=p;
		}
	}
	~List(){
		clear();
	}
};

int main ()
{
	List l;
	l.push_front(5);
	l.push_front(8);
	l.push_front(20);
	sizeof(l);
	l.travel();
	while(1)
	{
	}
	return 0;
}