c语言实现:二叉搜索树

#pragma once

#include<stdio.h>
#include<malloc.h>
#include<assert.h>

#define T int
#define FALST 0
#define TRUE 1
#define BOOL int

typedef struct BSTreeNode
{
	T data;
	BSTreeNode *leftChild;
	BSTreeNode *rightChild;
}BSTreeNode;

typedef struct BSTree
{
	BSTreeNode *root;
}BSTree;

void InitBSTree(BSTree *bst);
BOOL InsertBSTree(BSTree *bst, T x);
//BOOL InsertBSTree(BSTreeNode **t, T x);
BOOL InsertBSTree(BSTreeNode *&t, T x);
//求最大最小值
T Min(BSTree *bst);
T Min(BSTreeNode *t);
T Max(BSTree *bst);
T Max(BSTreeNode *t);
//排序，即进行中序遍历
void Sort(BSTree *bst);
void Sort(BSTreeNode *t);
//搜索值为key的节点，找不到则返回空
BSTreeNode* SearchBST(BSTree *bst,T key);
BSTreeNode* SearchBST(BSTree