line |
true |
false |
branch |
82
|
314 |
5025 |
if (node == NULL) { |
87
|
4930 |
95 |
if (key > node->key) |
90
|
95 |
0 |
if (key < node->key) |
99
|
12 |
545 |
if (node == NULL) |
102
|
124 |
421 |
if (key > node->key) |
105
|
59 |
362 |
if (key < node->key) |
112
|
12 |
567 |
if (node == NULL) |
115
|
124 |
443 |
if (key > node->key) |
118
|
59 |
384 |
if (key < node->key) |
121
|
309 |
75 |
if (node->left == NULL && node->right == NULL) { |
|
120 |
189 |
if (node->left == NULL && node->right == NULL) { |
122
|
26 |
94 |
if (parent == NULL) { |
125
|
73 |
21 |
else if (parent->left == node) { |
135
|
189 |
75 |
if (node->left == NULL) { |
136
|
77 |
112 |
if (parent == NULL) { |
139
|
10 |
102 |
else if (parent->left == node) { |
149
|
5 |
70 |
if (node->right == NULL) { |
150
|
2 |
3 |
if (parent == NULL) { |
153
|
3 |
0 |
else if (parent->left == node) { |
164
|
37 |
33 |
bstree_node *next_node = next_node_parent == NULL ? node->right : next_node_parent->left; |
167
|
33 |
37 |
return _bstree_del(tree, next_node_parent ? next_node_parent : node, next_node, next_node->key); |
175
|
70 |
37 |
if (node->left == NULL) |
182
|
0 |
0 |
if (node == NULL) |
191
|
16 |
0 |
if (node == NULL) |