line |
true |
false |
branch |
82
|
314 |
4856 |
if (node == NULL) { |
87
|
4772 |
84 |
if (key > node->key) |
90
|
84 |
0 |
if (key < node->key) |
99
|
12 |
518 |
if (node == NULL) |
102
|
105 |
413 |
if (key > node->key) |
105
|
51 |
362 |
if (key < node->key) |
112
|
12 |
549 |
if (node == NULL) |
115
|
105 |
444 |
if (key > node->key) |
118
|
51 |
393 |
if (key < node->key) |
121
|
308 |
85 |
if (node->left == NULL && node->right == NULL) { |
|
117 |
191 |
if (node->left == NULL && node->right == NULL) { |
122
|
26 |
91 |
if (parent == NULL) { |
125
|
66 |
25 |
else if (parent->left == node) { |
135
|
191 |
85 |
if (node->left == NULL) { |
136
|
88 |
103 |
if (parent == NULL) { |
139
|
4 |
99 |
else if (parent->left == node) { |
149
|
6 |
79 |
if (node->right == NULL) { |
150
|
2 |
4 |
if (parent == NULL) { |
153
|
4 |
0 |
else if (parent->left == node) { |
164
|
53 |
26 |
bstree_node *next_node = next_node_parent == NULL ? node->right : next_node_parent->left; |
167
|
26 |
53 |
return _bstree_del(tree, next_node_parent ? next_node_parent : node, next_node, next_node->key); |
175
|
79 |
30 |
if (node->left == NULL) |
182
|
0 |
0 |
if (node == NULL) |
191
|
16 |
0 |
if (node == NULL) |