1、二叉树操作源代码大全二叉树操作源代码大全二叉链表的结构定义#include #include typedef struct treevoid *data_p; /兼容所有类型struct tree *left;struct tree *right;tree_t;初始化一个节点, 初值置为dataint tree_make_node(tree_t *root, void *data)*root = (tree_t*) malloc(sizeof(tree_t);if(*root = NULL)printf(malloc errorn);return -1;(*root)-left = NULL;
2、(*root)-right = NULL;(*root)-data_p = data;return 0;将new_node插入树中作为where_to的左孩子, 返回新插入结点的指针tree_t* tree_insert_left(tree_t *new_node, tree_t *where_to)if(new_node != NULL)tree_t *tmp;tmp = where_to-left;where_to-left = new_node;new_node-left = tmp;return new_node;将new_node插入树中作为where_to的右孩子, 返回新插入结点
3、的指针tree_t* tree_insert_right(tree_t *new_node, tree_t *where_to)if(new_node != NULL)tree_t *tmp;tmp = where_to-right;where_to-right = new_node;new_node-right = tmp;return new_node;删除entry结点的左，右子树void tree_del_left(tree_t *entry)entry-left = NULL;free(entry);void tree_del_right(tree_t *entry)entry-ri
4、ght = NULL;free(entry);前序遍历二叉树void tree_pre_order(tree_t *root)if(root != NULL)VISIT(root);tree_pre_order(root-left);tree_pre_order(root-right);/*非递归思路： 先遍历左子树，遍历过程中那个访问遍历结点，并将其入栈，返回时退出当前栈顶元素遍历其其右子树*/void tree_pre_order_norec(tree_t *root)tree_t *stackMAX_ELE;int top = 0;while(root != NULL | top !=
5、0)if(root != NULL)VISIT(root);stacktop+ = root; /入栈root = root-left;elseroot = stack-top; /出栈root = root-right;中序遍历二叉树void tree_in_order(tree_t *root)if(root != NULL)tree_in_order(root-left);VISIT(root);tree_in_order(root-right);/*非递归思路： 先遍历左子树，并将遍历结点入栈，返回时退出当前栈顶元素并访问，再遍历其其右子树*/void tree_in_order_no
6、rec(tree_t *root)tree_t *stackMAX_ELE;int top = 0;while(root != NULL | top != 0)if(root != NULL)stacktop+ = root;root = root-left;elseroot = stack-top;VISIT(root);root = root-right;后序遍历二叉树void tree_pos_order(tree_t *root)if(root != NULL)tree_pos_order(root-left);tree_pos_order(root-right);VISIT(root
7、);/*思路：先遍历左子树，并将遍历结点入栈，返回时去栈顶元素，如果该元素的右子树已经被访问(flag为1)，访问该结点，否则标记flag为1*/void tree_pos_order_norec(tree_t *root)typedef structtree_t *node;int flag; /该结点的右子树是否被访问pos_order;pos_order stackMAX_ELE;int top = 0;while(root != NULL | 0)if(root != NULL)stacktop.node = root;stacktop.flag = 0;top+;root = roo
8、t-left;elsepos_order tmp = stacktop-1;if(tmp.flag = 0) /没有访问其右子树，访问之stacktop-1.flag = 1;root = tmp.node-right;else /如果已经出栈访问了其右子树，访问该结点VISIT(tmp.node);top-;层序遍历二叉树void tree_layer_order(tree_t *root)tree_t *queueMAX_ELE;int front = 0;int rear = 0;if(root = NULL) return;queuerear+ = root;while(front !
9、= rear)root = queuefront+;VISIT(root);if(root-left != NULL)queuerear+ = root-left;if(root-right != NULL)queuerear+ = root-right;打印二叉树，逆时针旋转90读， 遍历顺序为 右根左， 参数n为层数void tree_print(tree_t *root, int n)if(root != NULL)tree_print(root-right, n+1);for(int i = -1; i left, n+1);释放以root为根的二叉树void tree_free(tr
10、ee_t *root)if(root != NULL)tree_free(root-left);tree_free(root-right);free(root);测试实例：建立二叉树，并以各种方式遍历int make_tree(tree_t *root)char *node = ABCDEFGH;tree_make_node(root, (void*)(&node0); /根结点Atree_t *tmp;tree_t *p;tree_make_node(&tmp, (void*)(&node1); /B作为A的左子树p = tree_insert_left(tmp, *root);tree_m
11、ake_node(&tmp, (void*)(&node3); /D作为B的左子树p = tree_insert_left(tmp, p);tree_make_node(&tmp, (void*)(&node5); /F作为D的右子树p = tree_insert_right(tmp, p);tree_make_node(&tmp, (void*)(&node7); /H作为F的左子树p = tree_insert_left(tmp, p);tree_make_node(&tmp, (void*)(&node2); /C作为A的右子树p = tree_insert_right(tmp, *ro
12、ot);tree_make_node(&tmp, (void*)(&node4); /E作为C的右子树p = tree_insert_right(tmp, p);tree_make_node(&tmp, (void*)(&node6); /G作为E的左子树p = tree_insert_left(tmp, p);return 0;int main()tree_t *root;make_tree(&root);tree_print(root, 0);printf(nn);printf(前序遍历序列n);tree_pre_order(root);printf(n);tree_pre_order_norec(root);printf(nn);printf(中序遍历序列n);tree_in_order_norec(root);printf(n);tree_in_order(root);printf(nn);printf(后序遍历序列n);tree_pos_order(root);printf(n);tree_pos_order_norec(root);printf(nn);printf(层序遍历序列n);tree_layer_order(root);printf(nn);return 0;
