二叉查找树

参考资料：
http://blog.csdn.net/xiaofan086/article/details/8294382
<数据结构与算法分析>-C语言描述 Mark Allens Weiss

/* * searchTree.h *   以下为二叉查找树的定义 *  Created on: 2016年4月2日 *      Author: fay */#ifndef SEARCHTREE_H_#define SEARCHTREE_H_#include <stdio.h>#include <stdlib.h>typedef int ElementType;//以下定义Avl树的节点typedef struct TreeNode{    ElementType data;    struct TreeNode * left;//定义左孩子    struct TreeNode * right;//定义右孩子    int height;}*Position,*SearchTree;SearchTree MakeEmpty(SearchTree T);/*以下定义树查找操作，找到最大，最小元素*/Position Find(ElementType x,SearchTree T );Position FindMax(SearchTree T);Position FindMin(SearchTree T);/*以下定义树的插入，删除，返回指定位置的元素*/SearchTree Insert(ElementType x,SearchTree T );SearchTree Delete(ElementType x,SearchTree T );ElementType Retrieve(Position T);/*定义返回树的高度*/int Height(SearchTree T);void InOrderRecur(SearchTree T);#endif /* SEARCHTREE_H_ */

/* * searchTree.c * *  Created on: 2016年4月2日 *      Author: fay */#include "searchTree.h"SearchTree MakeEmpty(SearchTree T) {    if (T != 0) {        MakeEmpty(T->left);        MakeEmpty(T->right);        free(T);    }    return 0;}Position Find(ElementType X, SearchTree T) {    if (T == 0) {        return 0;    }    if (X < T->data) {        return Find(X, T->left);    } else if (X > T->data) {        return Find(X, T->right);    } else {        return T;    }}Position FindMax(SearchTree T) {    if (T == 0) {        return 0;    } else if (T->right != 0) {        return FindMax(T->right);    } else {        return T;    }}Position FindMin(SearchTree T) {    if (T == 0) {        return 0;    } else if (T->left != 0) {        return FindMin(T->left);    } else {        return T;    }}ElementType Retrieve(Position T) {    return T->data;}static int Max(int h1, int h2) {    return h1 > h2 ? h1 : h2;}int Height(SearchTree T) {    if (T == 0) {        return -1;    } else {        return Max(Height(T->left), Height(T->right)) + 1;    }}SearchTree Insert(ElementType X, SearchTree T) {    if (T == 0) {        T = (SearchTree) malloc(sizeof(struct TreeNode));        if (T == 0) {        } else {            T->data = X;            T->height = 0;            T->left = T->right = 0;        }    } else if (X < T->data) {        T->left = Insert(X, T->left);    } else if (X > T->data) {        T->right = Insert(X, T->right);    }    T->height = Max(Height(T->left), Height(T->right)) + 1;    return T;}/* * 中序遍历输出 */void InOrderRecur(SearchTree T) {    static int n = 0;    if (0 != T) {        InOrderRecur(T->left);        printf("%d \n", T->data);        InOrderRecur(T->right);    }}/** * 先根遍历 */void PreOrderRecur(SearchTree T) {    static int n = 0;    if (0 != T) {        printf("%d \n", T->data);        PreOrderRecur(T->left);        PreOrderRecur(T->right);    }}

/* ============================================================================ Name        : test二叉查找树 Author      : fay Version     : Copyright   : Your copyright notice Description : Hello World in C, Ansi-style ============================================================================ */#include "searchTree.c"#define N 15int main(void) {    SearchTree T = 0;        int i;        int j = 0;        T = MakeEmpty(0);        for( i = 0,j=0; i < N; i++, j = (j + 7) % 50)        {            printf("j=%d \n",j);            T = Insert( j, T );        }        InOrderRecur(T);        printf("×××××××××××××××××××\n");        PreOrderRecur(T);        printf("height=%d \n", T->height);        puts("插入 4 \n");        printf("===================\n");        T = Insert(4, T);        InOrderRecur(T);        printf("×××××××××××××××××××\n");        PreOrderRecur(T);        printf("height=%d \n", T->height);        return EXIT_SUCCESS;}