edited by
642 views
2 votes
2 votes

A.  Total no. of trees that were there in the forest.

B. Total no. of nodes in the forest.

C. Total no. of nodes which have only right child.

D. Return max element among all nodes.

edited by

1 Answer

3 votes
3 votes
According to the given algorithm it just calculates total no of right child of right sub tree only which doesnt matches with any of the options given.

Related questions

0 votes
0 votes
0 answers
1
Na462 asked Jan 16, 2019
374 views
Consider a binary tree for every node | P - Q | <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h 0. T...
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
Soumya29 asked Oct 22, 2018
302 views
I know the answer. But is there any general FORMULA for it?If yes, please provide the complete derivation of it. In the solution, they used $\rightarrow 2^{h-1}+1.$ I tri...
0 votes
0 votes
0 answers
4
Na462 asked Oct 20, 2018
596 views
Consider 4 labeled 1,2,3,4. The number of distinct binary tree possible such that whose inorder traversal is 1,2,3,4 are ........