#include "stdio.h" #include "malloc.h" typedef struct node { int key; struct node *lchild, *rchild; }BSTNode, *BSTree; void InsertBST(BSTree *bst, int key) { BSTree s; if (*bst == NULL) { s = (BSTree)malloc(sizeof(BSTNode)); s->key = key; s->lchild = NULL; s->rchild = NULL; *bst = s; } else if (key<(*bst)->key) InsertBST(&((*bst)->lchild), key); else if (key > (*bst)->key) InsertBST(&((*bst)->rchild), key); } void CreateBST(BSTree *bst) { int key; *bst = NULL; scanf("%d",&key); while (key != 0) { InsertBST(bst, key); scanf("%d",&key); } } void inorder(BSTree bt) { if (bt != NULL) { inorder(bt->lchild); printf("%3d",bt->key); inorder(bt->rchild); } } int FindTreeDeep(BSTree BT){ int deep=0; if(BT){ int lchilddeep=FindTreeDeep(BT->lchild); int rchilddeep=FindTreeDeep(BT->rchild); deep=lchilddeep>=rchilddeep?lchilddeep+1:rchilddeep+1; } return deep; } int main() { BSTree bt; CreateBST(&bt); inorder(bt); printf("\n"); printf("%d\n",FindTreeDeep(bt)); getchar(); return 0; }版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请联系我们举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/231031.html原文链接：https://javaforall.net
