Searched refs:right (Results 1 – 4 of 4) sorted by relevance
43 struct bt_node_t *bt_create_node(struct bt_node_t *left, struct bt_node_t *right, struct bt_node_t … in bt_create_node() argument50 node->right = right; in bt_create_node()81 this_node = this_node->right; in bt_insert()92 last_node->right = insert_node; in bt_insert()123 this_node = this_node->right; in bt_query()165 if (this_node->left == NULL || this_node->right == NULL) in bt_delete()169 to_delete = bt_get_minimum(this_node->right); in bt_delete()178 to_delete_son = to_delete->right; in bt_delete()190 to_delete->parent->right = to_delete_son; in bt_delete()223 if (nd->right != NULL) in bt_destroy_tree()[all …]
7 struct bt_node_t *right; member43 struct bt_node_t *bt_create_node(struct bt_node_t *left, struct bt_node_t *right, struct bt_node_t …
77 assert(((struct test_value_t *)tree->bt_node->right->value)->tv == tv3->tv); in ktest_bitree_case1()97 assert(((struct test_value_t *)node2->right->value)->tv == tv4->tv); in ktest_bitree_case1()111 assert(tree->bt_node->right == NULL); in ktest_bitree_case1()
126 exercise the right to control the distribution of derivative or216 patents or other property right claims or to contest validity of any