UTpaper

Free mock tests & test series

Question 7Asked in UGC NET Computer Science, December 2014 (Paper II & III, Selected Questions)

A full binary tree with n leaves contains

  1. An nodes
  2. Blog₂ nodes
  3. C2n – 1 nodes
  4. D2ⁿ nodes
Show answerHide answer

Correct answer: (C) 2n – 1 nodes

Explanation

A full binary tree with n leaves contains n – 1 internal nodes, so total nodes = internal nodes + leaves = (n – 1) + n = 2n – 1.

From UGC NET Computer Science PYQ, December 2014 (Paper II & III, Selected Questions)

This is question 7 of UGC NET Computer Science PYQ, December 2014 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.