| line |
true |
false |
branch |
|
82
|
314 |
5525 |
if (node == NULL) { |
|
87
|
5460 |
65 |
if (key > node->key) |
|
90
|
65 |
0 |
if (key < node->key) |
|
99
|
12 |
505 |
if (node == NULL) |
|
102
|
100 |
405 |
if (key > node->key) |
|
105
|
43 |
362 |
if (key < node->key) |
|
112
|
12 |
516 |
if (node == NULL) |
|
115
|
100 |
416 |
if (key > node->key) |
|
118
|
43 |
373 |
if (key < node->key) |
|
121
|
310 |
63 |
if (node->left == NULL && node->right == NULL) { |
|
|
99 |
211 |
if (node->left == NULL && node->right == NULL) { |
|
122
|
26 |
73 |
if (parent == NULL) { |
|
125
|
52 |
21 |
else if (parent->left == node) { |
|
135
|
211 |
63 |
if (node->left == NULL) { |
|
136
|
104 |
107 |
if (parent == NULL) { |
|
139
|
6 |
101 |
else if (parent->left == node) { |
|
149
|
4 |
59 |
if (node->right == NULL) { |
|
150
|
1 |
3 |
if (parent == NULL) { |
|
153
|
3 |
0 |
else if (parent->left == node) { |
|
164
|
38 |
21 |
bstree_node *next_node = next_node_parent == NULL ? node->right : next_node_parent->left; |
|
167
|
21 |
38 |
return _bstree_del(tree, next_node_parent ? next_node_parent : node, next_node, next_node->key); |
|
175
|
59 |
21 |
if (node->left == NULL) |
|
182
|
0 |
0 |
if (node == NULL) |
|
191
|
16 |
0 |
if (node == NULL) |