Question: Given the following inclusions and type definitions: #include structbtnode_int; typedefstructbtnode_int *btnode; structbtnode_int { btnode left; int *data; btnode right; }; structbinary_search_tree_int; typedefstructbinary_search_tree_int *bst; structbinary_search_tree_int {
Given the following inclusions and type definitions:
#include
structbtnode_int;
typedefstructbtnode_int *btnode;
structbtnode_int
{
btnode left;
int *data;
btnode right;
};
structbinary_search_tree_int;
typedefstructbinary_search_tree_int *bst;
structbinary_search_tree_int
{
btnode root;
};
And the following function definition:
int f1(bstt,intv)
{
btnode c =t->root;
int n = 0;
while (c !=NULL)
{
if ((*(t->data))
{
n++;
c = c->left;
}
else
{
c =NULL;
}
}
return n;
}
- What does the functionf1() do?
2. What possible situation(s) could cause the code to fail, i.e. crash?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
