3.7-12假设二叉树采用二叉链存储结构进行存储。设计一个算法采用分治法求一棵二叉 树 bt 的高度

#include <bits/stdc++.h>
#include "Btree.cpp"

using namespace std;

int Height(BTNode *bt) {
	if(bt == NULL)
		return 0;
	int lh = Height(bt->lchild);
	int rh = Height(bt->rchild);
	return lh > rh ? lh + 1 : rh +1;
}

int main() {
	BTNode *bt;
	int a[]= {5,2,3,4,1,6};
	int b[]= {2,3,5,1,4,6};
	int n = sizeof(a) / sizeof(a[0]);
	bt = CreateBTree(a, b, n);
	DispBTree(bt);
	cout << endl;
	cout << "高度为：" << Height(bt);
	cout << endl;
	DestroyBTree(bt);
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

typedef struct BNode {
	int data;
	struct BNode *lchild,*rchild;
} BTNode;

BTNode *CreateBTree(int a[],int b[], int n) {
	int k;
	if(n <= 0)
		return NULL;
	BTNode *bt =(BTNode *) malloc (sizeof(BTNode));
	bt -> data = a[0];
	for(k = 0; k < n; k++)
		if(a[0] == b[k])
			break;
	//递归创建左子树
	bt -> lchild = CreateBTree(a+1, b, k);
	//递归创建左子树
	bt -> rchild = CreateBTree(a+k+1, b+k+1,n-1-k);
	return bt;
}

void DispBTree(BTNode *bt) {
	if (bt != NULL) { //根左右
		cout << bt->data << " ";
		DispBTree(bt->lchild);
		DispBTree(bt->rchild);
	}
}

void DestroyBTree(BTNode *bt) {
	if(bt != NULL) {
		DestroyBTree(bt->lchild);
		DestroyBTree(bt->rchild);
		free(bt);
	}
}