数据结构之打印二叉树所有(根结点起)路径—整理严蔚敏数据结构

#include<iostream>
#include<malloc.h>
using namespace std;
#define STACKSIZE 20
#define SIZEADD 10
typedef char ElemType;
typedef struct BTNode
{
	ElemType data;
	struct BTNode *pLchild;
	struct BTNode *pRchild;
}BTNode,*pBTNode;
typedef struct Stack
{
	pBTNode *pBottom;
	pBTNode *pTop;
	int Stacksize;
}Stack;
void InitStack(Stack &S)
{
	S.pBottom = new pBTNode[STACKSIZE];
	S.pTop = S.pBottom;
	S.Stacksize = STACKSIZE;
}
void CreateBT(pBTNode &pT)
{
	ElemType c;
	cin >> c;
	if (c == '#')
		pT = NULL;
	else
	{
		pT = new BTNode;
		pT->data = c;
		CreateBT(pT->pLchild);
		CreateBT(pT->pRchild);
	}
}
bool StackEmpty(Stack S)
{
	if (S.pBottom == S.pTop)
		return true;
	else
		return false;
}
void Push(Stack &S, pBTNode pT)
{
	if (S.pTop - S.pBottom >= S.Stacksize)
	{
		S.pBottom = (pBTNode *)realloc(S.pBottom, (STACKSIZE + SIZEADD)*sizeof(pBTNode));
		S.pTo