Queues Q.132

0. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

Answer
Comment
Array

Option : B
Explanation : A strictly binary tree with 'n' leaves must have (2n-1) nodes. Verify for some small 'n'. This can be proved by the principle of mathematical induction.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.