二叉树--前序遍历、中序遍历、后序遍历、层次遍历

//BTree.h#ifndef _BTREE_H_#define _BTREE_H_#define BT_LEFT 0#define BT_RIGHT 1typedef unsigned long long BTPos;   //64bit typedef void BTree;typedef struct _tag_BTreeNode BTreeNode;     //define the node pointerstruct _tag_BTreeNode{BTreeNode* left;BTreeNode* right;};typedef void (BTree_Printf)(BTreeNode*);BTree* BTree_Create();void BTree_Destroy(BTree* tree);void BTree_Clear(BTree* tree);int BTree_Insert(BTree* tree,BTreeNode* node,BTPos pos,int count,int flag); void BTree_Display(BTree* tree,BTree_Printf* pFunc,int gap,char div);BTreeNode* BTree_Delete(BTree* tree,BTPos pos,int count);BTreeNode* BTree_Get(BTree* tree,BTPos pos,int count);BTreeNode* BTree_Root(BTree* tree);int BTree_Height(BTree* tree);int BTree_Count(BTree* tree);int BTree_Degree(BTree* tree);#endif

//BTree.c#include "BTree.h"#include <malloc.h>#include <stdio.h>typedef struct _tag_TBTree TBTree;struct _tag_TBTree     //define the node of header {int count;BTreeNode* root;};static int recursive_degree(BTreeNode* root){int ret = 0;if(root!=NULL){if(root->left!=NULL){ret++;}if(root->right!=NULL){ret++;}if(ret == 1){int ld = recursive_degree(root->left);int rd = recursive_degree(root->right);if(ret < ld){ret = ld;}if(ret < rd){ret = rd;}}}return ret;}static int recursive_height(BTreeNode* root){int ret = 0;if(root!=NULL){int lh = recursive_height(root->left);int rh = recursive_height(root->right);ret = ((lh>rh)?lh:rh) + 1;}return ret;}static int recursive_count(BTreeNode* node){int ret = 0;if(node!=NULL){ret = recursive_count(node->left) + 1 + recursive_count(node->right);}return ret;}static void recursive_display(BTreeNode* node,BTree_Printf* pFunc,int format,int gap,char div){int i = 0;if((node!=NULL)&&(pFunc!=NULL)){for(i=0;i<format;i++){printf("%c",div);}pFunc(node);printf("\n");if((node->left!=NULL)||(node->right!=NULL)){recursive_display(node->left,pFunc,format+gap,gap,div);recursive_display(node->right,pFunc,format+gap,gap,div);}}else   //when there  has only-left child node or only-right child node,print the char to fill the place{for(i=0;i<format;i++){printf("%c",div);}printf("\n");}}BTree* BTree_Create(){TBTree* ret = (TBTree*)malloc(sizeof(TBTree));if(ret != NULL){ret->count = 0;ret->root = NULL;}return ret;}void BTree_Destroy(BTree* tree){free(tree);}void BTree_Clear(BTree* tree){TBTree* btree = (TBTree*)tree;if(btree != NULL){btree->count = 0;btree->root = NULL;}}int BTree_Insert(BTree* tree,BTreeNode* node,BTPos pos,int count,int flag)   // pos :position; count :moving times;{int ret = 0;int bit = 0;TBTree* btree = (TBTree*)tree;ret = (btree!=NULL)&&(node!=NULL)&&((flag==BT_LEFT)||(flag==BT_RIGHT));if(ret){BTreeNode* parent = NULL;BTreeNode* current = btree->root;node->left = NULL;node->right = NULL;while((count>0)&&(current!=NULL)){bit = pos & 1;pos = pos >> 1;parent = current;if(bit==BT_LEFT){current = current->left;}else if(bit==BT_RIGHT){current = current->right;}count--;}if(flag==BT_LEFT)    //when the current node has some children node,the current node should be inserted after the node{node->left = current;}else if(flag == BT_RIGHT){node->right = current;}if(parent!=NULL){if(bit == BT_LEFT){parent->left = node;}else if(bit == BT_RIGHT){parent->right = node;}}else      //insert the first node{btree->root = node;}btree->count++;}return ret;} void BTree_Display(BTree* tree,BTree_Printf* pFunc,int gap,char div){TBTree* btree = (TBTree*)tree;if((btree!=NULL)&&(pFunc!=NULL)){recursive_display(btree->root,pFunc,0,gap,div);}}BTreeNode* BTree_Delete(BTree* tree,BTPos pos,int count){BTreeNode* ret = NULL;TBTree* btree = (TBTree*)tree;      //×öÒ»¸ö¿Ç int bit = 0;if(btree!=NULL){BTreeNode* parent = NULL;BTreeNode* current = btree->root;while((count>0)&&(current!=NULL)){bit = pos & 1;pos = pos >> 1;parent = current;if(bit==BT_LEFT){current = current->left;}else if(bit==BT_RIGHT){current = current->right;}count--;}if(parent!=NULL){if(bit==BT_LEFT){parent->left = NULL;}else if(bit == BT_RIGHT){parent->right = NULL;}}else   //the only one node{btree->root = NULL;}ret = current;    //importantbtree->count = btree->count - recursive_count(ret);}return ret;}BTreeNode* BTree_Get(BTree* tree,BTPos pos,int count){BTreeNode* ret = NULL;TBTree* btree = (TBTree*)tree;int bit = 0;if(btree!=NULL){BTreeNode* parent = NULL;BTreeNode* current = btree->root;while((count>0)&&(current!=NULL)){bit = pos & 1;pos = pos >> 1;parent = current;      //record the current nodeif(bit == BT_LEFT){current = current->left;}else if(bit == BT_RIGHT){current = current->right;}count--;}ret = current;   //important}return ret;}BTreeNode* BTree_Root(BTree* tree){BTreeNode* ret = NULL;TBTree* btree = (TBTree*)tree;if(btree != NULL){ret = btree->root;}return ret;}int BTree_Height(BTree* tree){int ret = 0;TBTree* btree = (TBTree*)tree;if(btree!=NULL){ret = recursive_height(btree->root);}return ret;}int BTree_Count(BTree* tree){int ret = 0;TBTree* btree = (TBTree*)tree;if(btree!=NULL){ret = btree->count;}return ret;}int BTree_Degree(BTree* tree){int ret = 0;TBTree* btree = (TBTree*)tree;if(btree!=NULL){ret = recursive_degree(btree->root);}return ret;}

//LinkQueue.h#ifndef _LINKQUEUE_H_#define _LINKQUEUE_H_typedef void LinkQueue;LinkQueue* LinkQueue_Create();void LinkQueue_Destroy(LinkQueue* queue);void LinkQueue_Clear(LinkQueue* queue);int LinkQueue_Append(LinkQueue* queue, void* item);void* LinkQueue_Retrieve(LinkQueue* queue);void* LinkQueue_Header(LinkQueue* queue);int LinkQueue_Length(LinkQueue* queue);#endif

#include <malloc.h>#include <stdio.h>#include "LinkQueue.h"typedef struct _tag_LinkQueueNode TLinkQueueNode;struct _tag_LinkQueueNode{    TLinkQueueNode* next;    void* item;};typedef struct _tag_LinkQueue{    TLinkQueueNode* front;    TLinkQueueNode* rear;    int length;} TLinkQueue;LinkQueue* LinkQueue_Create() // O(1){    TLinkQueue* ret = (TLinkQueue*)malloc(sizeof(TLinkQueue));        if( ret != NULL )    {        ret->front = NULL;        ret->rear = NULL;        ret->length = 0;    }        return ret;}void LinkQueue_Destroy(LinkQueue* queue) // O(n){    LinkQueue_Clear(queue);    free(queue);}void LinkQueue_Clear(LinkQueue* queue) // O(n){    while( LinkQueue_Length(queue) > 0 )    {        LinkQueue_Retrieve(queue);    }}int LinkQueue_Append(LinkQueue* queue, void* item) // O(1){    TLinkQueue* sQueue = (TLinkQueue*)queue;    TLinkQueueNode* node = (TLinkQueueNode*)malloc(sizeof(TLinkQueueNode));    int ret = (sQueue != NULL ) && (item != NULL) && (node != NULL);        if( ret )    {        node->item = item;                if( sQueue->length > 0 )        {            sQueue->rear->next = node;            sQueue->rear = node;            node->next = NULL;        }        else        {            sQueue->front = node;            sQueue->rear = node;            node->next = NULL;        }                sQueue->length++;    }        if( !ret )    {        free(node);    }        return ret;}void* LinkQueue_Retrieve(LinkQueue* queue) // O(1){    TLinkQueue* sQueue = (TLinkQueue*)queue;    TLinkQueueNode* node = NULL;    void* ret = NULL;        if( (sQueue != NULL) && (sQueue->length > 0) )    {        node = sQueue->front;                sQueue->front = node->next;                ret = node->item;                free(node);                sQueue->length--;                if( sQueue->length == 0 )        {            sQueue->front = NULL;            sQueue->rear = NULL;        }    }        return ret;}void* LinkQueue_Header(LinkQueue* queue) // O(1){    TLinkQueue* sQueue = (TLinkQueue*)queue;    void* ret = NULL;        if( (sQueue != NULL) && (sQueue->length > 0) )    {        ret = sQueue->front->item;    }        return ret;}int LinkQueue_Length(LinkQueue* queue) // O(1){    TLinkQueue* sQueue = (TLinkQueue*)queue;    int ret = -1;        if( sQueue != NULL )    {        ret = sQueue->length;    }        return ret;}

//main.c /*-----------time: 2016-4-7version: DEV-C++ 5.2.0.3 -----------*/#include <stdio.h>#include <stdlib.h>#include "BTree.h"#include "LinkQueue.h"struct Node{BTreeNode header;char v;};void print_data(BTreeNode* node){if(node!=NULL){printf("%c",((struct Node*)node)->v);}}void pre_order_traversal(BTreeNode* root)    //前序遍历{if(root!=NULL){printf("%c,",((struct Node*)root)->v);pre_order_traversal(root->left);pre_order_traversal(root->right);}}void mid_order_traversal(BTreeNode* root)    //中序遍历{if(root!=NULL){mid_order_traversal(root->left);printf("%c,",((struct Node*)root)->v);mid_order_traversal(root->right);}}void post_order_traversal(BTreeNode* root)   //后序遍历{if(root!=NULL){post_order_traversal(root->left);post_order_traversal(root->right);printf("%c,",((struct Node*)root)->v);}}void level_order_traversal(BTreeNode* root)  //层次遍历will use Queue{if(root!=NULL){LinkQueue* queue = LinkQueue_Create();if(queue!=NULL){LinkQueue_Append(queue,root);while(LinkQueue_Length(queue)>0){struct Node* node = (struct Node*)LinkQueue_Retrieve(queue);printf("%c,",node->v);LinkQueue_Append(queue,node->header.left);LinkQueue_Append(queue,node->header.right);}}LinkQueue_Destroy(queue);}}int main(int argc, char *argv[]) {BTree* tree = BTree_Create();struct Node n1 = {{NULL,NULL},'A'};struct Node n2 = {{NULL,NULL},'b'};struct Node n3 = {{NULL,NULL},'C'};struct Node n4 = {{NULL,NULL},'D'};struct Node n5 = {{NULL,NULL},'E'};struct Node n6 = {{NULL,NULL},'F'};struct Node n7 = {{NULL,NULL},'G'};BTree_Insert(tree,(BTreeNode*)&n1,0,0,0);     //ABTree_Insert(tree,(BTreeNode*)&n2,0x00,1,0);  //bBTree_Insert(tree,(BTreeNode*)&n3,0x01,1,0);  //CBTree_Insert(tree,(BTreeNode*)&n4,0x00,2,0);  //DBTree_Insert(tree,(BTreeNode*)&n5,0x02,2,0);  //EBTree_Insert(tree,(BTreeNode*)&n6,0x01,2,0);  //FBTree_Insert(tree,(BTreeNode*)&n7,0x03,2,0);  //FBTree_Display(tree,print_data,2,'-');printf("pre_order_traversal (Ç°Ðò±éÀú): \n");pre_order_traversal(BTree_Root(tree));printf("\n");printf("mid_order_traversal (ÖÐÐò±éÀú): \n");mid_order_traversal(BTree_Root(tree));printf("\n");printf("post_order_traversal (ºóÐò±éÀú): \n");post_order_traversal(BTree_Root(tree));printf("\n");printf("level_order_traversal (²ã´Î±éÀú): \n");level_order_traversal(BTree_Root(tree));printf("\n");BTree_Destroy(tree);return 0;}