What may be the psuedo code for finding the size of a tree? – McqOptions

MCQOPTIONS

1.	What may be the psuedo code for finding the size of a tree?
A.	find_size(root_node‚Äö√Ñ√∂‚àö√ë‚àö¬®>left_node) + 1 + find_size(root_node‚Äö√Ñ√∂‚àö√ë‚àö¬®>right_node)
B.	find_size(root_node‚Äö√Ñ√∂‚àö√ë‚àö¬®>left_node) + find_size(root_node‚Äö√Ñ√∂‚àö√ë‚àö¬®>right_node)
C.	find_size(root_node‚Äö√Ñ√∂‚àö√ë‚àö¬®>right_node) ‚Äö√Ñ√∂‚àö√ë‚àö¬® 1
D.	find_size(root_node‚Äö√Ñ√∂‚àö√ë‚àö¬®>left_node + 1
Answer» B. find_size(root_node‚Äö√Ñ√∂‚àö√ë‚àö¬®>left_node) + find_size(root_node‚Äö√Ñ√∂‚àö√ë‚àö¬®>right_node)

Discussion

No Comment Found

Related MCQs

What is the code below trying to print?
What must be the missing logic below so as to print mirror of a tree as below as an example?
What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?
The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)i) from root search for the node to be deletedii)iii) delete the node atwhat must be statement ii) and fill up statement iii)
Identify the reason which doesn’t play a key role to use threaded binary trees?
Which of the following traversing algorithm is not used to traverse in a tree?
CODE_FOR_HAVING_RECURSIVE_CALLS_TO_EITHER_ONLY_LEFT_TREE_OR_RIGHT_TREES_OR_TO_BOTH_SUBTREES_DEPENDING_ON_THEIR_EXISTENCE?$
What may be the psuedo code for finding the size of a tree?
The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
Why we prefer threaded binary trees?