教你利用栈非递归复制二叉树(共3页).doc

利用栈非递归复制二叉树非递归复制二叉树#include #include #define STACK_INIT_SIZE 100#define STACK_INCR 10typedef struct BiTNode /二叉树节点char data;struct BiTNode *lChild, *rChild; BiTNode, *BiTree;typedef struct /栈的定义BiTree *base;BiTree *top;int stackSize; Stack;void initStack(Stack &stack) /初始化栈stack.base = stack.top = (BiTree *)malloc(sizeof(BiTree) * STACK_INIT_SIZE);stack.stackSize = STACK_INIT_SIZE;void pop(Stack &S, BiTree &T) /出栈if