Sort binary tree code

#include// #include#include#includetypedef int DataType;typedef struct BST_node{DataType data;struct BST_node *lchild,*rchild;}BST_T;BST_T* Search_BST(BST_T** root,DataType key){BST_T *p =*root;while(p){if(p->data==key) return p;p=(key < p->data)?p->lchild:p->rchild;}return NULL;}void Insert_BST(BST_T**T,DataType data){BST_T *p_bst =(BST_T*)malloc(sizeof(BST_T));if(!p_bst) return;p_bst->data =data;p_bst->lchild=p_bst->rchild=NULL;//empty treeif((*T)==NULL){*T = p_bst;return;}//Whether it exists, if it already exists, return it, do not insertif (Search_BST(T, data) != NULL) return;//insertBST_T* tnode=NULL; BST_T *troot=(*T);while(troot){tnode = troot;troot =(datadata)? troot->lchild:troot->rchild;}if(data < tnode->data)tnode->lchild =p_bst;elsetnode->rchild =p_bst;}void CreateBST(BST_T** T,int a[],int n){int i;for(i=0;ilchild);//cout << T->data << " ";printf("%d\t",T->data);MidOrderTraverse(T->rchild);}}void PostOrderTraverse(BST_T* T){if (T){PostOrderTraverse(T->lchild);PostOrderTraverse(T->rchild);printf("%d\t",T->data);}}void PreOrderTraverse(BST_T* T){if (T){printf("%d\t",T->data);PreOrderTraverse(T->lchild);PreOrderTraverse(T->rchild);}}void DeleteBSTNode(BST_T** root,DataType data){BST_T *p = *root;BST_T *parent =NULL;BST_T *s =NULL;if (!(*root)) return;if(p->data == data){// delete the leaf nodeif(p->lchild==NULL && p->rchild==NULL)*root =NULL;// only one child nodeelse if(!p->rchild&&p->lchild)*root =p->lchild;else if (!p->lchild&&p->rchild)*root =p->rchild; //To exit the recursion//The left subtree has both the right subtreeelse{s = p->rchild;//delete the node of the penultimate layerif(!s->lchild)s->lchild =p->lchild;//Delete the node from the penultimate layer upelse{while(s->lchild){parent = s;s= s->lchild;}parent->lchild =s->rchild;s->lchild =p->lchild;s->rchild = p->rchild;}(*root) = s;}free(p);}else if(data > p->data)DeleteBSTNode(&(p->rchild),data);else if(data < p->data)DeleteBSTNode(&(p->lchild),data);}int main(){int arr[] = { 17,12,19,10,15,18,25,8,11,13,16,22};BST_T *root =NULL;CreateBST(&root,arr,12);//printf("\nCreate BST: ");// printf("\nMid order traverse: ");// MidOrderTraverse(root);printf("\npre order traverse: ");PreOrderTraverse(root);// printf("\npost order traverse: ");// PostOrderTraverse(root);//find a nodeBST_T *result = Search_BST(&root, 12);printf("Search result: %d\n",result->data);//delete node 12 in the binary sorted treeDeleteBSTNode(&root, 8);printf("\npre order traverse: ");PreOrderTraverse(root);// printf("\npost order traverse: ");// PostOrderTraverse(root);// printf("\n");}