二叉树结构体
typedef struct TreeNode {
char val;
TreeNode* left;
TreeNode* right;
TreeNode() :val(NULL), left(NULL), right(NULL) {
};
TreeNode(char x) :val(x), left(NULL), right(NULL) {
};
}*BiTree;
二叉排序树的插入
也可通过插入建立二叉排序树
void insert_Tree(BiTree &T, char s) {
if (T == NULL)
{
T = new TreeNode(s);
}
else if (T->val > s)
insert_Tree(T->left, s);
else
insert_Tree(T->right, s);
}
二叉搜索树的高度
int hight(BiTree root) {
if (root == NULL)
return 0;
else if(hight(root->left)> hight(root->right)){
return hight(root->left)+