二叉树

#include "stdafx.h"
#include<stdlib.h>
#include<iostream>
using namespace std;
typedef int ElementType;


struct TreeNode;
typedef struct TreeNode *Position;
typedef struct TreeNode *SearchTree;
SearchTree MakeEmpty(SearchTree T);
Position Find(ElementType x, SearchTree T);
Position FindMin(ElementType x, SearchTree T);
Position FindMax(ElementType x, SearchTree T);
SearchTree Insert(ElementType x, SearchTree T);
SearchTree Delete(ElementType x, SearchTree T);
ElementType Retrieve(Position P);

struct TreeNode
{
    ElementType Element;
    SearchTree left;
    SearchTree right;
};

SearchTree MakeEmpty(SearchTree T)
{
    if (T != NULL)
    {
        MakeEmpty(T->left);
        MakeEmpty(T->right);
        free(T);
    }
}

Position Find(ElementType x,SearchTree T)
{
    if (T == NULL)
        return NULL;
    if (x < T->Element)
        return Find(x, T->left);
    else
        if (x > T->Element)
            return Find(x, T->right);
        else
        {
            return T;
        }
}

Position FindMin(SearchTree T)
{
    if (T == NULL)
        return NULL;
    else if (T->left == NULL)
        return T;
    else
        return FindMin(T->left);
}

Position FindMax(SearchTree T)
{
    if(T!=NULL)
        while (T->right!=NULL)
        {
            T = T->right;
        }
    return T;
}

SearchTree Insert(ElementType x,SearchTree T)
{
    if (T == NULL) {
        T = (SearchTree)malloc(sizeof(struct TreeNode));
        if (T == NULL)
            EXIT_FAILURE;
        else
        {
            T->Element = x;
            T->left = T->right = NULL;
        }
    }
    else
    {
        if (x < T->Element)
            T->left = Insert(x, T->left);
        else if (x > T->Element)
            T->right = Insert(x, T->right);
       //否则在已在树上什么都不做
        return T;
    }

}

SearchTree Delete(ElementType x, SearchTree T)
{
    Position TmpCell;
    if (T == NULL)
        cout << "Element no found";
    else if (x < T->Element)
        T->left = Delete(x, T->left);
    else
      if (x > T->Element)
         T->right = Delete(x, T->right);
      else//找到要删除的元素
      {
          if (T->left&&T->right) {
              TmpCell = FindMin(T->right);
              T->Element = TmpCell->Element;
              T->right = Delete(T->Element, T->right);
          }
          else //只有一个或者没有儿子
          {
              TmpCell = T;
              if (T->left == NULL)
                  T = T->right;
              else if (T->right == NULL)
                  T = T->left;
              free(TmpCell);
          }
      }
    return T;
    

}

int main()
{
    return 0;
}