Ace Test Series: Data Structures - Binary Trees

Question

Answer 1

It's so simple to solve this type of questions bro...

first you assume a tree which give different outputs for all your options, then run your algorithm by knowing the output you can tick corresponding option....

for this ans is height of the tree and assumed root of height = 1

Comments

yes I understood

Is the code will be like

x+=(node->left?(DO(node->left):(node->right?DO(node->right):1)))?

I mean at last if it is leaf ,will return 1 and then add to count total number of leaves

right?

---

sorry mam i didn't understand your code....

if your code will be like 

x+=(node->left?DO(node->left):(node->right?DO(node->right):1);

it is given 1 for leaf node but it is wrong mam why because it's only check left sub-tree only for the internal node which has left sub-tree and right sub-tree.

---

yes, u r corrct

ternary operator of if else

Condition ?block1:block2;

Answer 2

Option d .

We can write like this type of recurrence relation . And we take a binary tree and execute this algo  we get height of binary tree.

Comments

if(node->left || node->right)

{

        x=(node->left?DO(node->left):0,node->right?DO(node->right):0)+1;

}

return x;

------------------------------------------------------------------

if we modify the given code like this that there is no max call

then will the code print number of leaves of the tree?

---

Yes mam . It will print no of leaves