c++ 实现二叉树高度

 1 #include<iostream>
 2 using namespace std;
 3 
 4 //二叉树节点
 5 struct BinaryNode
 6 {
 7     char ch;
 8     BinaryNode* lchild;
 9     BinaryNode* rchild;
10 };
11 int HeightTree(BinaryNode* root);
12 //初始化二叉树
13 void CreateBinaryTree() {
14     BinaryNode node1 = { ‘A‘,NULL,NULL };
15     BinaryNode node2 = { ‘B‘,NULL,NULL };
16     BinaryNode node3 = { ‘C‘,NULL,NULL };
17     BinaryNode node4 = { ‘D‘,NULL,NULL };
18     BinaryNode node5 = { ‘E‘,NULL,NULL };
19     BinaryNode node6 = { ‘F‘,NULL,NULL };
20     BinaryNode node7 = { ‘G‘,NULL,NULL };
21     BinaryNode node8 = { ‘H‘,NULL,NULL };
22     //建立节点关系
23     node1.lchild = &node2;
24     node1.rchild = &node6;
25     node2.rchild = &node3;
26     node3.lchild = &node4;
27     node3.rchild = &node5;
28     node6.rchild = &node7;
29     node7.lchild = &node8;    
30     cout << "二叉树高度"<< HeightTree(&node1)<<endl;
31 }
32 //二叉树遍历
33 int HeightTree(BinaryNode* root) {
34     if (!root) return 0;
35     int l = HeightTree(root->lchild);
36     int r = HeightTree(root->rchild) ;
37     return l > r ? l+1 : r+1;
38 }
39 int main() {
40     CreateBinaryTree();
41 }