主要用到了递归的思想,代码如下'
#include<iostream>
#include<stack>
using namespace std;
#define Max 50 //定义全局变量不需要等号和分号
struct Node {
int data;
Node* lchild;
Node* rchild;
};
//树的非递归先序遍历
void PreOrder(Node* p) {
stack <Node*> P; //初始化栈P用来保存结点
P.push(p); //根节点入栈
while (!P.empty()) {
p = P.top(); //读栈顶元素
cout << p->data;//访问
P.pop(); //出栈
if (p->rchild) P.push(p->rchild); //右儿子入栈
if (p->lchild) P.push(p->lchild); //左儿子入栈
}
}
//依据先序中序构造二叉树
Node * CreatBiTree(int A[],int B[],int la,int ra,int lb,int rb) {
Node* root = (Node*)malloc(sizeof(Node));
root->data = A[la];
int i = 0;
while (B[i] != A[la])i++;
int llen = i - lb;
int rlen = rb - i;
if (lb >= rb) {
root->lchild = root->rchild = NULL;
}
else {
root->lchild = CreatBiTree(A, B, la + 1, la+ llen, lb, lb+ llen-1);
root->rchild = CreatBiTree(A, B, ra - rlen + 1, ra, rb- rlen+ 1, rb);
}
return root;
}
int main() {
/*int A[7] = { 1,2,4,5,3,6,7 };
int B[7] = { 4,2,5,1,6,3,7 };
Node* root=CreatBiTree(A, B, 0, 6, 0, 6);*/
int A[7] = {1,2,4,5,3};
int B[7] = {4, 2,5,1,3};
Node* root = CreatBiTree(A, B, 0, 4, 0, 4);
PreOrder(root);
}
注意:递归主要问题在于确定递归出口和递归边界,这里用两端以及子问题长度llen,rlen来确定递归出口,直接用i确定容易出错。