数据结构之二叉树

作为一个自动化专业毕业的年轻小伙，自己的编程水平有限，需要广泛学习训练。特此记录下自己编程学习代码。非科班毕业，没有严格考量时间和空间的复杂度。

学习当然是学习了别人的思想然后内化的呀。

BinaryTree.h

#ifndef BINARYTREE_H

    #define BINARYTREE_H

    #include "Queue.h"

    #ifdef __cplusplus
    extern "C"
    {
    #endif 

    struct BinaryNode
    {
        void *pData;                //数据域
        struct BinaryNode *pLeft;   //左孩子
        struct BinaryNode *pRight;  //右孩子
    };

    struct BinaryTree
    {
        struct BinaryNode *pRoot;
        int size;
    };

    void PrintValCallBack(void *pData);

    //创建二叉树
    struct BinaryTree *CreatBinaryTree(void);

    //上下左右顺序往二叉树插入数据指针
    void InsertToBinaryTree(struct BinaryTree *,void *);

    //往二叉搜索树插入数据指针(左边小，右边大)
    void InsertToBinarySearchTree(struct BinaryTree *,void *);
    
    //递归遍历二叉树
    //先序遍历：根左右
    //中序遍历：左根右
    //后序遍历：左右根(深度优先)
    void TraverseTreeRootFirst(struct BinaryTree *,void (*printCallBack)(void*));
    void TraverseTreeRootSecond(struct BinaryTree *,void (*printCallBack)(void*));
    void TraverseTreeRootThird(struct BinaryTree *,void (*printCallBack)(void*));

    //使用队列层序遍历(广度优先)
    void TraverseTreeSameLavel(struct BinaryTree *,void (*printCallBack)(void*));

    //输出叶子节点
    void PrintLeaves(struct BinaryTree *,void (*printCallBack)(void*));
    
    //求树高
    int GetBinaryTreeHeight(struct BinaryTree *);

    //销毁二叉树
    void DestroyBinaryTree(struct BinaryTree * );

    #ifdef __cplusplus
    }
    #endif 

#endif

BinaryTree.c

#include "BinaryTree.h"

void PrintValCallBack(void *pData)
{
    int *pInt = (int *)pData;
    printf("cur val = %dn",*pInt);
}

//创建二叉树
struct BinaryTree *CreatBinaryTree(void)
{
    struct BinaryTree *pTree;
    pTree = (struct BinaryTree *)malloc(sizeof(struct BinaryTree));
    if (pTree == NULL)
    {
        return(NULL);
    }

    pTree->pRoot = NULL;
    pTree->size = 0;
    return(pTree);
}

//上下左右顺序往二叉树插入数据指针
void InsertToBinaryTree(struct BinaryTree *pTree,void *pData)
{
    if (pTree == NULL)
    {
        return;
    }
    if (pData == NULL)
    {
        return;
    }

    //创建新节点
    struct BinaryNode *pNewNode;
    pNewNode = (struct BinaryNode *)malloc(sizeof(struct BinaryNode));
    if (pNewNode == NULL)
    {
        return;
    }
    //新节点初始化
    pNewNode->pData = pData;
    pNewNode->pLeft = NULL;
    pNewNode->pRight = NULL;

    // PrintCallBack(pData);

    //使用队列实现上下左右插入
    //队列节点的数据指针为数的节点指针
    //树无根节点
    if (pTree->pRoot == NULL)
    {
        pTree->pRoot = pNewNode;
        pTree->size ++;
        return;
    }

    //树有根节点
    void *pQueue;
    pQueue = CreatQueue();
    PushQueue(pQueue,pTree->pRoot);
    while (1)
    {  
        //当前节点为队列头节点的数据指针
        struct BinaryNode *p = (struct BinaryNode *)GetQueueHead(pQueue);

        // PrintCallBack(p->pData);

        //当前节点无左孩子
        if (p->pLeft == NULL)
        {
            p->pLeft = pNewNode;
            break;
        }
        else 
        {
            PushQueue(pQueue,p->pLeft);
        }

        //当前节点无右孩子
        if (p->pRight == NULL)
        {
            p->pRight = pNewNode;
            break;
        }
        else 
        {
            PushQueue(pQueue,p->pRight);
        }

        PopQueue(pQueue);
    }

    DestroyQueue(pQueue);
    
    pTree->size ++;

}

//获取数据域数值较大的节点
static struct BinaryNode *GetLargerNode(struct BinaryNode *p0,struct BinaryNode *p1)
{
    int *pData0,*pData1;
    pData0 = (int *)(p0->pData);
    pData1 = (int *)(p1->pData);

    if (*pData0 > *pData1)
    {
        return(p0);
    }
    else 
    {
        return(p1);
    }
}

static int InsertBinarySearchTree(struct BinaryNode *pNode,struct BinaryNode *pNewNode)
{
    if (pNode == NULL)
    {
        return(-1);
    }
    if (pNewNode == NULL)
    {
        return(-1);
    }

    //获取数据域数值比较大的节点
    struct BinaryNode *pLargerNode;
    pLargerNode = GetLargerNode(pNode,pNewNode);

    //新节点的数据域数值比当前节点的小
    if (pLargerNode == pNode)
    {
        //当前节点无左孩子
        if (pNode->pLeft == NULL)
        {
            pNode->pLeft = pNewNode;
            return(0);
        }
        //当前节点有左孩子
        else 
        {
            InsertBinarySearchTree(pNode->pLeft,pNewNode);
        }
    }
    //新节点的数据域数值比当前节点的大
    else if (pLargerNode == pNewNode)
    {
        //当前节点无右孩子
        if (pNode->pRight == NULL)
        {
            pNode->pRight = pNewNode;
            return(0);
        }
        //当前节点有右孩子
        else 
        {
            InsertBinarySearchTree(pNode->pRight,pNewNode);
        }
    }
}

//往二叉搜索树插入数据指针(左边小，右边大)
void InsertToBinarySearchTree(struct BinaryTree *pTree,void *pData)
{
    if (pTree == NULL)
    {
        return;
    }
    if (pData == NULL)
    {
        return;
    }

    //创建新节点
    struct BinaryNode *pNewNode;
    pNewNode = (struct BinaryNode *)malloc(sizeof(struct BinaryNode));
    if (pNewNode == NULL)
    {
        return;
    }
    //新节点初始化
    pNewNode->pData = pData;
    pNewNode->pLeft = NULL;
    pNewNode->pRight = NULL;

    //树无根节点
    if (pTree->pRoot == NULL)
    {
        pTree->pRoot = pNewNode;
        pTree->size ++;
        return;
    }

    //树有根节点
    //递归插入
    int ret = InsertBinarySearchTree(pTree->pRoot,pNewNode);
    if (ret == 0)
    {
        pTree->size ++;
    }
}

//对节点先序遍历的递归实现
static void RootFirst(struct BinaryNode *pRoot,void (*printCallBack)(void*))
{
    if (pRoot == NULL)
    {
        return;
    }
    if (printCallBack == NULL)
    {
        return;
    }

    printCallBack(pRoot);

    RootFirst(pRoot->pLeft,printCallBack);

    RootFirst(pRoot->pRight,printCallBack);
}

//先序遍历
void TraverseTreeRootFirst(struct BinaryTree *pTree,void (*printCallBack)(void*))
{
    if (pTree == NULL)
    {
        return;
    }
    if (printCallBack == NULL)
    {
        return;
    }
    RootFirst(pTree->pRoot,printCallBack);
}

//对节点中序遍历的递归实现
static void RootSecond(struct BinaryNode *pRoot,void (*printCallBack)(void*))
{
    if (pRoot == NULL)
    {
        return;
    }
    if (printCallBack == NULL)
    {
        return;
    }

    RootSecond(pRoot->pLeft,printCallBack);

    printCallBack(pRoot);

    RootSecond(pRoot->pRight,printCallBack);
}

//中序遍历
void TraverseTreeRootSecond(struct BinaryTree *pTree,void (*printCallBack)(void*))
{
    if (pTree == NULL)
    {
        return;
    }
    if (printCallBack == NULL)
    {
        return;
    }

    RootSecond(pTree->pRoot,printCallBack);
}

//对节点后序遍历的递归实现
static void RootThird(struct BinaryNode *pRoot,void (*printCallBack)(void*))
{
    if (pRoot == NULL)
    {
        return;
    }
    if (printCallBack == NULL)
    {
        return;
    }

    RootThird(pRoot->pLeft,printCallBack);

    RootThird(pRoot->pRight,printCallBack);

    printCallBack(pRoot);
}

//后序遍历
void TraverseTreeRootThird(struct BinaryTree *pTree,void (*printCallBack)(void*))
{
    if (pTree == NULL)
    {
        return;
    }
    if (printCallBack == NULL)
    {
        return;
    }

    RootThird(pTree->pRoot,printCallBack);
}

//使用队列层序遍历(广度优先)
void TraverseTreeSameLavel(struct BinaryTree *pTree,void (*printCallBack)(void*))
{
    if (pTree == NULL)
    {
        return;
    }
    if (printCallBack == NULL)
    {
        return;
    }

    if (pTree->pRoot == NULL)
    {
        return;
    }

    void *pQueue;
    pQueue = CreatQueue();
    PushQueue(pQueue,pTree->pRoot);

    //队列实现同层遍历
    while (1)
    {
        if (IsQueueEmpty(pQueue)== true)
        {
            break;
        }

        struct BinaryNode *pNode;
        pNode = (struct BinaryNode *)GetQueueHead(pQueue);

        //打印当前节点
        printCallBack(pNode);

        if (pNode->pLeft != NULL)
        {
            PushQueue(pQueue,pNode->pLeft);
        }
        if (pNode->pRight != NULL)
        {
            PushQueue(pQueue,pNode->pRight);
        }

        PopQueue(pQueue);
    }

    DestroyQueue(pQueue);
}

static void PrintLeavesNode(struct BinaryNode *pNode,void (*printCallBack)(void*))
{
    if (pNode == NULL)
    {
        return;
    }
    if (printCallBack == NULL)
    {
        return;
    }

    //使用先序递归遍历打印叶子节点
    if ((pNode->pLeft == NULL) && (pNode->pRight == NULL))
    {
        printCallBack(pNode);
        return;
    }
    PrintLeavesNode(pNode->pLeft,printCallBack);
    PrintLeavesNode(pNode->pRight,printCallBack);
}

//输出叶子节点
void PrintLeaves(struct BinaryTree *pTree,void (*printCallBack)(void*))
{
    if (pTree == NULL)
    {
        return;
    }
    if (printCallBack == NULL)
    {
        return;
    }
    PrintLeavesNode(pTree->pRoot,printCallBack);
}

//后序遍历求树高
static int GetHeight(struct BinaryNode *pNode)
{
    //通过后序遍历实现求树的高度
    int h = 0, hl = 0, hr = 0;
	if (pNode==NULL)
    {
		return 0;
	}
    else
    {
		hl = GetHeight(pNode->pLeft);//递归遍历左子树
		hr = GetHeight(pNode->pRight);//递归遍历右子树
		h = (hr > hl) ? (hr) : (hl);
		return (h + 1);
	}
}

//求树高
int GetBinaryTreeHeight(struct BinaryTree *pTree)
{
    int ret;
    if (pTree == NULL)
    {
        ret = 0;
    }
    else 
    {
        ret = GetHeight(pTree->pRoot);
    }
    return(ret);
}

//销毁二叉树
//使用链表暂存节点、并释放对应内存
void DestroyBinaryTree(struct BinaryTree *pTree)
{
    if (pTree == NULL)
    {
        return;
    }

    //树上无根节点
    if (pTree->pRoot == NULL)
    {
        free(pTree);
        return;
    }

    struct LinkList *pLinkList;
    pLinkList = CreatLinkList();
    if (pLinkList == NULL)
    {
        return;
    }

    InsertToLinkListHead(pLinkList,pTree->pRoot);

    int size = pTree->size;

    while (1)
    {
        if (size == 0)
        {
            break;
        }

        struct BinaryNode *pNode;
        pNode = (struct BinaryNode *)GetDataPointerOfFirstNodeInLinkList(pLinkList);

        if (pNode->pLeft != NULL)
        {
            InsertToLinkListTail(pLinkList,pNode->pLeft);
        }

        if (pNode->pRight != NULL)
        {
            InsertToLinkListTail(pLinkList,pNode->pRight);
        }

        free(pNode);
        size --;
    }

    DestroyLinkList(pLinkList);

    free(pTree);
}