数据结构----二叉树叶子结点到根节点的高度计算

代码：

#include<stdio.h>
#include<stdlib.h>
typedef struct bstTree {int data;struct bstTree* lchild, *rchild;
}bstTree;
void createBSTTree(bstTree* & T, int data) {//创建二叉排序树bstTree *p = NULL;if (!T) {p = (bstTree*)malloc(sizeof(bstTree));p->data = data;p->lchild = p->rchild = NULL;T = p;return;}if (data < T->data) {//左子树插入createBSTTree(T->lchild, data);}else {//右子树插入createBSTTree(T->rchild, data);}
}
void prePrint(bstTree*  BSTTree) {//前序遍历二叉排序树if (BSTTree) {printf("%d ", BSTTree->data);prePrint(BSTTree->lchild);prePrint(BSTTree->rchild);}
}
void calLeafHeight(bstTree* T,int h) {//计算叶子结点到根节点的高度if (!T) {return;}if (T->lchild == NULL && T->rchild == NULL) {printf("%d叶子结点到根节点的高度为%d\n", T->data, h + 1);}else {calLeafHeight(T->lchild, h + 1);//左孩子calLeafHeight(T->rchild, h + 1);//右孩子}
}
int main() {bstTree* T = NULL;//一定要初始化为空树int count, data;printf("开始构造二叉排序树:\n输入二叉排序树结点的数目:");scanf_s("%d", &count);while (count--) {//构造二叉排序树printf("输入二叉排序树的第%d个结点:", count + 1);scanf_s("%d", &data);createBSTTree(T, data);}printf("前序遍历二叉排序树\n");prePrint(T);//前序遍历二叉排序树printf("\n");calLeafHeight(T, 0);printf("\n");system("pause");return 0;
}

测试截图：

时间复杂度O(logn),空间复杂度O(1)

如果存在什么问题，欢迎批评指正！谢谢！