Consider the C function foo and the binary tree shown.

typedef struct node {
int val;
struct node *left, *right;
} node;

int foo(node *p) {
int retval;
if (p == NULL)
return 0;
else {
retval = p-val + foo(p-left) + foo(p-right);
printf("%d ", retval);
return retval;
}
}

Whe

Question

Consider the C function foo and the binary tree shown.

typedef struct node {
 int val;
 struct node *left, *right;
} node;

int foo(node *p) {
 int retval;
 if (p == NULL)
 return 0;
 else {
 retval = p->val + foo(p->left) + foo(p->right);
 printf("%d ", retval);
 return retval;
 }
}

When foo is called with a pointer to the root node of the given binary tree, what will it print?

Accepted Answer

3 8 5 13 11 10. The function recursively calculates the sum of values in the binary tree, printing the cumulative sum at each node after processing its left and right children. This results in the output reflecting the order of node processing and their respective sums.

Solution

Related GATE Technical questions