Recursion Tree

Question

Is this code running fine ?if yes what is the output I am getting 2 here.

Comments

@ saxena0612 yes given ans is 22 but,I am not sure how it is coming,because whenever we move to left and decrement the node value(1->0),from there on none of left subtree value decremented,similarly in right side,(7->0),they are incrementing x only and that too they are not retuning.?is there anything i am missing here.:(

---

yes...the code is not returning  'x'...Even if we assume that the code is returning  'x'....still the returned value will be a garbage value since 'x' is uninitialized and incrementing a garbage value results in another garbage value........correct me if i am wrong

---

@junaid ahmad,

Understand the role of following statements:-

if(root->data %2 == 1)

Which means, run the inside code that is,

root->data - = 1;

only when root->data is an odd value until unless don't decrement.

Role of x:-

Just to pass your precious time while solving the question, because neither we are propagating this value to further function call nor we are using it in calculation of final answer.

At the last they are just asking, SUM OF INTERNAL NODE, which you will get 22.