In A Full Binary Tree If Number Of Internal Nodes Is I Then #552
In a full binary tree if number of internal nodes is I, then number of leaves L are?
This multiple choice question (MCQ) is related to the book/course
gs gs121 Data Structures and Algorithms.
It can also be found in
gs gs121 Binary Trees - Binary Tree Properties - Quiz No.1.
In a full binary tree if number of internal nodes is I, then number of leaves L are?
L = 2*I
L = I + 1
L = I – 1
L = 2*I – 1
Similar question(s) are as followings:
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
