Tree DFS

Question

int func(Node root) {
    if(root == NULL) return 0;
    else if(root->left == NULL && root->right == NULL) return 2;
    else return(3 + func(root->left) + func(root->right));    
}

Above code is executed on the following rooted tree.

What will be the output?

Comments

yes 32 is correct .

root = 3 + 7(left) + 22(right)

---

yes 32 is correct !

---

nice question

Answer 1

It is adding 3 for all internal vertices & 2 for leaves.

Total internal vertices = 6.

Total leaves= 7.

Therefore count = 6*3 + 7*2 = 32

Comments

rohit typo ?

---

Corrected. :)

Answer 2

32 [each leaf node return 2]