apaki/unicstl
1
0
Fork 0
mirror of https://gitee.com/apaki/unicstl.git synced 2025-05-17 19:41:36 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

avl树调试通过，很nice！

Browse Source
This commit is contained in:
建峰 2024-06-23 23:40:27 +08:00
parent 7ba86577b1
commit dca7598c51
2 changed files with 51 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

81
src/tree.c
View File

@ -1402,6 +1402,16 @@ static bool tree_rebalance(ptree_t head, ptree_node_t tree)
#endif
static void tree_set_balance(struct _tree* self, struct _tree_node * node)
{
assert(self != NULL);
if(node == NULL)
{
return;
}
node->balance = self->height(self, node->right) - self->height(self, node->left);
}
static struct _tree_node* tree_turn_left(struct _tree* self, struct _tree_node* root)
{
assert(self != NULL);
@ -1409,14 +1419,25 @@ static struct _tree_node* tree_turn_left(struct _tree* self, struct _tree_node*
assert(root->right != NULL);
struct _tree_node* node = root->right;
root->parent->right = node; // step1
if(root->parent != NULL)
{
if(root->parent->left == root) // step1
{
root->parent->left = node;
}
else if(root->parent->right == root)
{
root->parent->right = node; // setp1
}
}
node->parent = root->parent; // step2
root->parent = node; // step3
node->left = root; // step4
root->right = node->left; // step4
node->left = root; // step5
root->balance = 0;
node->balance = 0;
tree_set_balance(self, root);
tree_set_balance(self, node);
return node;
}
@ -1427,13 +1448,25 @@ static struct _tree_node* tree_turn_right(struct _tree* self, struct _tree_node*
assert(root->left != NULL);
struct _tree_node* node = root->left;
root->parent->left = node; // step1
if(root->parent != NULL)
{
if(root->parent->left == root)
{
root->parent->left = node; // step1
}
else if(root->parent->right == root)
{
root->parent->right = node; // setp1
}
}
node->parent = root->parent; // step2
root->parent = node; // step3
node->right = root; // step4
root->left = node->right; // step4
node->right = root; // step5
root->balance = 0;
node->balance = 0;
tree_set_balance(self, root);
tree_set_balance(self, node);
return node;
}
@ -1467,26 +1500,9 @@ uint32_t tree_height(struct _tree* self, struct _tree_node* root)
{
return 0;
}
uint32_t left = tree_height(self, root->left);
uint32_t right = tree_height(self, root->right);
if(left > right)
{
return left + 1;
}
else
{
return right + 1;
}
}
static void tree_set_balance(struct _tree* self, struct _tree_node * node)
{
assert(self != NULL);
if(node == NULL)
{
return;
}
node->balance = self->height(self, node->right) - self->height(self, node->left);
uint32_t left_height = tree_height(self, root->left);
uint32_t right_height = tree_height(self, root->right);
return (left_height > right_height) ? (left_height + 1) : (right_height + 1);
}
/**
@ -1537,11 +1553,15 @@ static bool tree_avl_rebalance(struct _tree* self, struct _tree_node* root)
root = tree_trun_right_then_left(self, root);
}
}
if(root->parent != NULL)
{
tree_avl_rebalance(self, root->parent);
}
else
{
self->_root = root;
}
return true;
}
@ -1671,7 +1691,6 @@ bool tree_avl_insert(struct _tree* self, void* obj)
}
self->rebalance(self, root);
}
self->_size++;
return true;
}

2
test/tree_test.c
View File

@ -279,7 +279,7 @@ void tree_test(void)
void test_tree_num(void)
{
uint32_t i = 0;
int data[] = { 1,2,3,4,5,6,7,8,9,10 };
int data[] = { 1,2,3,4,5,6};
// int data[] = { 5,2,3,1,7,8,6 };
int temp = 0;
uint32_t len = sizeof(data) / sizeof(data[0]);