Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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;

}

  1. 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

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Income Tax Fundamentals 2013

Authors: Gerald E. Whittenburg, Martha Altus Buller, Steven L Gill

31st Edition

1111972516, 978-1285586618, 1285586611, 978-1285613109, 978-1111972516

More Books

Students also viewed these Programming questions