【數據結構基礎】求二叉樹高度

#include<stdio.h> #include<stdlib.h> static int count=0; typedef struct TreeNode{ char element; struct TreeNode *left,*right; }Tree,*BTree; BTree BuildTree(void){ BTree T; char ch;

>>阅读原文<<