思路:
运用deth作为树的深度,用deth1为左子数遍历层次次数,deth2为右子树遍历层数次数,之后进行比较,较大的作为deth树的深度。
举例:
代码实现:
#include <iostream>
using namespace std;
typedef struct My_tree {
char data;
struct My_tree* lson;
struct My_tree* rson;
}mytree;
int deth_tree(mytree* root);
//创建二叉树
void Create_tree() {
mytree node1 = { 'A',NULL,NULL };
mytree node2 = { 'B',NULL,NULL };
mytree node3 = { 'C',NULL,NULL };
mytree node4 = { 'D',NULL,NULL };
mytree node5 = { 'E',NULL,NULL };
mytree node6 = { 'F',NULL,NULL };
mytree node7 = { 'G',NULL,NULL };
mytree node8 = { 'H',NULL,NULL };
node1.lson = &node2;
node1.rson = &node6;
node2.rson = &node3;
node3.lson = &node4;
node3.rson = &node5;
node6.rson = &node7;
node7.lson = &node8;
cout << "树的深度:" << deth_tree(&node1) << endl;
}
int deth_tree(mytree* root) {
if (root == NULL) {
return 0;
}
int deth = 0;
int deth1=deth_tree(root->lson);//左子树遍历
int deth2=deth_tree(root->rson);//右子树遍历
deth = deth1 > deth2 ? deth1+1 : deth2+1;因为结束时返回0,所以要加1表示返回次数
return deth;
}
int main() {
Create_tree();
return 0;
}