Consider the following statements i A binary tree can contain at-03664

Consider the following statements.<br>(i) A binary tree can contain at least 2L Nodes at level L.<br>(ii) A complete binary tree of depth d is a binary tree that contains 2L Nodes at each level L between 0 and d,<br>both inclusive.<br>(iii) The total number of nodes (Tn ) in a complete binary tree of depth d is 2 d+1 - 1 .<br>(iv) The height of the complete binary tree can be written as h = log 2 (Tn+1)-1 where Tn is Total number of Nodes.<br>Which one of the following is correct in respect of the above statements regarding the Binary trees?

Online Quiz This multiple choice question (MCQ) is related to the book/course vu cs301 Data Structures. It can also be found in vu cs301 Mid Term - Quiz No.16.


Similar question(s) are as followings:



Online Quizzes of cs301 Data Structures

Choose an organization

Theme Customizer

Gaussian Texture



Gradient Background