Which_of_the_following_is_correct_with_respect_to_binary_trees?$

Question

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

Let T be a binary tree. For every k ‚Äö√Ñ√∂‚àö¬¢‚Äö√Ñ¬¢ 0, there are no more than 2k nodes in level k

TuteeHUB · Answer

Let T be a binary tree with ‚âà√≠¬¨‚Ñ¢ levels. Then T has no more than 2‚âà√≠¬¨‚Ñ¢ ‚Äö√Ñ√∂‚àö√ë‚àö¬® 1 nodes

TuteeHUB · Answer

Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1))

TuteeHUB · Answer

All of the mentioned

1.	Which_of_the_following_is_correct_with_respect_to_binary_trees?$
A.	Let T be a binary tree. For every k ‚Äö√Ñ√∂‚àö¬¢‚Äö√Ñ¬¢ 0, there are no more than 2k nodes in level k
B.	Let T be a binary tree with ‚âà√≠¬¨‚Ñ¢ levels. Then T has no more than 2<sup>‚âà√≠¬¨‚Ñ¢ ‚Äö√Ñ√∂‚àö√ë‚àö¬® 1</sup> nodes
C.	Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1))
D.	All of the mentioned
Answer» E.

Discussion