创建二叉树
来源:互联网 发布:ubuntu不显示任务栏 编辑:程序博客网 时间:2024/05/14 03:53
#include <stdio.h>
#include <malloc.h>
#include "BTree.h"
typedef struct _tag_BTree TBTree;
struct _tag_BTree//定义头结点
{
int count;
BTreeNode* root;//根结点
};
static void recursive_display(BTreeNode* node, BTree_Printf* pFunc, int format, int gap, char div) // O(n)
{
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
{
for(i=0; i<format; i++)
{
printf("%c", div);
}
printf("\n");
}
}
static int recursive_count(BTreeNode* root) // O(n)
{
int ret = 0;
if( root != NULL )
{
ret = recursive_count(root->left) + 1 + recursive_count(root->right);
}
return ret;
}
static int recursive_height(BTreeNode* root) // O(n)
{
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_degree(BTreeNode* root) // O(n)
{
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;
}
BTree* BTree_Create() // O(1)
{
TBTree* ret = (TBTree*)malloc(sizeof(TBTree));//定义一个头结点的结构体
if( ret != NULL )//初始化
{
ret->count = 0;
ret->root = NULL;
}
return ret;
}
void BTree_Destroy(BTree* tree) // O(1)
{
free(tree);
}
void BTree_Clear(BTree* tree) // O(1)
{
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) // O(n)
{
TBTree* btree = (TBTree*)tree;
int ret = (btree != NULL) && (node != NULL) && ((flag == BT_LEFT) || (flag == BT_RIGHT));
int bit = 0;
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 )//判断新结点的子树是左子树还是右子树
{
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
{
btree->root = node;//对于第一个结点
}
btree->count++;//
}
return ret;
}
BTreeNode* BTree_Delete(BTree* tree, BTPos pos, int count) // O(n)//删除操作逻辑与插入算法一致
{
TBTree* btree = (TBTree*)tree;
BTreeNode* ret = NULL;
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
{
btree->root = NULL;
}
ret = current;
btree->count = btree->count - recursive_count(ret);
}
return ret;
}
BTreeNode* BTree_Get(BTree* tree, BTPos pos, int count) // O(n)
{
TBTree* btree = (TBTree*)tree;
BTreeNode* ret = NULL;
int bit = 0;
if( btree != NULL )
{
BTreeNode* current = btree->root;
while( (count > 0) && (current != NULL) )
{
bit = pos & 1;
pos = pos >> 1;
if( bit == BT_LEFT )
{
current = current->left;
}
else if( bit == BT_RIGHT )
{
current = current->right;
}
count--;
}
ret = current;
}
return ret;
}
BTreeNode* BTree_Root(BTree* tree) // O(1)
{
TBTree* btree = (TBTree*)tree;
BTreeNode* ret = NULL;
if( btree != NULL )
{
ret = btree->root;
}
return ret;
}
int BTree_Height(BTree* tree) // O(n)
{
TBTree* btree = (TBTree*)tree;
int ret = 0;
if( btree != NULL )
{
ret = recursive_height(btree->root);
}
return ret;
}
int BTree_Count(BTree* tree) // O(1)
{
TBTree* btree = (TBTree*)tree;
int ret = 0;
if( btree != NULL )
{
ret = btree->count;
}
return ret;
}
int BTree_Degree(BTree* tree) // O(n)
{
TBTree* btree = (TBTree*)tree;
int ret = 0;
if( btree != NULL )
{
ret = recursive_degree(btree->root);
}
return ret;
}
void BTree_Display(BTree* tree, BTree_Printf* pFunc, int gap, char div) // O(n)
{
TBTree* btree = (TBTree*)tree;
if( btree != NULL )
{
recursive_display(btree->root, pFunc, 0, gap, div);
}
}
#include <malloc.h>
#include "BTree.h"
typedef struct _tag_BTree TBTree;
struct _tag_BTree//定义头结点
{
int count;
BTreeNode* root;//根结点
};
static void recursive_display(BTreeNode* node, BTree_Printf* pFunc, int format, int gap, char div) // O(n)
{
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
{
for(i=0; i<format; i++)
{
printf("%c", div);
}
printf("\n");
}
}
static int recursive_count(BTreeNode* root) // O(n)
{
int ret = 0;
if( root != NULL )
{
ret = recursive_count(root->left) + 1 + recursive_count(root->right);
}
return ret;
}
static int recursive_height(BTreeNode* root) // O(n)
{
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_degree(BTreeNode* root) // O(n)
{
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;
}
BTree* BTree_Create() // O(1)
{
TBTree* ret = (TBTree*)malloc(sizeof(TBTree));//定义一个头结点的结构体
if( ret != NULL )//初始化
{
ret->count = 0;
ret->root = NULL;
}
return ret;
}
void BTree_Destroy(BTree* tree) // O(1)
{
free(tree);
}
void BTree_Clear(BTree* tree) // O(1)
{
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) // O(n)
{
TBTree* btree = (TBTree*)tree;
int ret = (btree != NULL) && (node != NULL) && ((flag == BT_LEFT) || (flag == BT_RIGHT));
int bit = 0;
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 )//判断新结点的子树是左子树还是右子树
{
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
{
btree->root = node;//对于第一个结点
}
btree->count++;//
}
return ret;
}
BTreeNode* BTree_Delete(BTree* tree, BTPos pos, int count) // O(n)//删除操作逻辑与插入算法一致
{
TBTree* btree = (TBTree*)tree;
BTreeNode* ret = NULL;
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
{
btree->root = NULL;
}
ret = current;
btree->count = btree->count - recursive_count(ret);
}
return ret;
}
BTreeNode* BTree_Get(BTree* tree, BTPos pos, int count) // O(n)
{
TBTree* btree = (TBTree*)tree;
BTreeNode* ret = NULL;
int bit = 0;
if( btree != NULL )
{
BTreeNode* current = btree->root;
while( (count > 0) && (current != NULL) )
{
bit = pos & 1;
pos = pos >> 1;
if( bit == BT_LEFT )
{
current = current->left;
}
else if( bit == BT_RIGHT )
{
current = current->right;
}
count--;
}
ret = current;
}
return ret;
}
BTreeNode* BTree_Root(BTree* tree) // O(1)
{
TBTree* btree = (TBTree*)tree;
BTreeNode* ret = NULL;
if( btree != NULL )
{
ret = btree->root;
}
return ret;
}
int BTree_Height(BTree* tree) // O(n)
{
TBTree* btree = (TBTree*)tree;
int ret = 0;
if( btree != NULL )
{
ret = recursive_height(btree->root);
}
return ret;
}
int BTree_Count(BTree* tree) // O(1)
{
TBTree* btree = (TBTree*)tree;
int ret = 0;
if( btree != NULL )
{
ret = btree->count;
}
return ret;
}
int BTree_Degree(BTree* tree) // O(n)
{
TBTree* btree = (TBTree*)tree;
int ret = 0;
if( btree != NULL )
{
ret = recursive_degree(btree->root);
}
return ret;
}
void BTree_Display(BTree* tree, BTree_Printf* pFunc, int gap, char div) // O(n)
{
TBTree* btree = (TBTree*)tree;
if( btree != NULL )
{
recursive_display(btree->root, pFunc, 0, gap, div);
}
}
0 0
- 创建二叉树 创建单链表
- 树----创建二叉树
- 创建二叉树
- 二叉树的创建
- 创建二叉树
- 创建二叉树
- 二叉树的创建
- 前序中序创建二叉树
- 创建二叉树
- java 二叉树创建
- java创建二叉树
- 创建二叉树
- 二叉树创建
- 二叉树的创建。
- 创建二叉树
- 创建二叉树
- java创建二叉树
- 创建二叉树
- ScheduledExecutorService stop
- Quick-cocos2dx中关于Eclipse LDT调试--环境Mac
- java之泛型面试题
- Reverse Nodes in k-Group
- 小P的故事——神奇的换零钱
- 创建二叉树
- C++拷贝构造函数(深拷贝,浅拷贝)
- Fight for dream.
- 最小公倍数(nyoj 517)
- UVA 10534 - Wavio Sequence LIS
- IOS中的懒加载lazyLoad
- segment fault
- Java 设计模式 接口型模式 之 类型介绍 (一)
- BGP▪香港太平洋数据中心