Multiple choice Which of the following is incorrect about a full binary tree? In a non-empty full binary tree, T has I internal nodes, then the total number of nodes is N = 2I + 1 and number of leaves is L = I + 1. If full binary tree T has a total of N nodes, the number of internal nodes is I = (N + 1)/2. In a non-empty full binary tree, T has I internal nodes, then the number of leaves is L = I + 1. If T has L leaves, the total number of nodes is N = 2L – 1. If T has L leaves, the number of internal nodes is I = L – 1. Reveal answer Fill a bubble to check yourself B Correct answer Explanation It is an incorrect statement since if full binary tree T has a total of N nodes, the number of internal nodes is I = (N – 1)/2. And the number of internal nodes is I = (N + 1)/2.