GATE Overflow Test Series | Mock GATE | Test 5 | Question: 47

Question

Consider a C function print() which takes a root of binary search tree and a positive number $‘k’$ as arguments as given below:

struct node
{
    int data;
    struct node *left, *right;
};
int count = 0;
void print(struct node *root, int k)
{
    if (root!=NULL && count < k)
    {
        print(root -> right, k);
        count++;
        if(count == k)
            printf("%d", root -> data);
        print(root -> left, k);
    }
}

What is the sum of all the values output by print(root, $2$), where root represents root of the following Binary Search Tree? (You can assume the binary search tree to be terminated properly by NULLs)

Answer 1

The code will stop printing value when the value of $k$ will be equal to count. Initially the value of count is $0$ its value will become $1$ at node $7$ and will become $2$ at node $6$ hence will print the value $6$.

Comments

@debmalyaSEN count is global here

---

Yeah count being static does not change the result

---

i completely ignored that count is declared global..silly mistakw