c++栈

结点构造和链表一样，不再重复

TStack::TStack(){length    = 0;topNode   = NULL;stackNode = NULL;}TStack::~TStack(){delete topNode;delete stackNode;}void TStack::pop(){if (length){topNode = topNode->next;length--;}else{cout<<"当前栈中没有元素！"<<endl;}}void TStack::printStack(){if (length){int index = length;Node* tempNode = new Node();//Node* tempNode = (Node*)malloc(sizeof(Node));tempNode = topNode;while (index){cout<< tempNode->data <<" ";tempNode = tempNode->next;index--;}cout<<endl;delete tempNode;}else{cout<<"当前栈中没有元素！"<<endl;}}void TStack::push(int data){Node* tempNode = new Node();tempNode->data = data;tempNode->next = topNode;topNode = tempNode;length++;}int TStack::GetLenth(){return length;}