Skip to content
Related Articles

Related Articles

UGC-NET | UGC-NET CS 2017 Nov – III | Question 31
  • Last Updated : 19 Mar, 2018

Consider a full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf. Which of the following is correct for the full binary tree?
(A) e = i+n
(B) e = i+2n
(C) e = 2i+n
(D) e = 2n+i


Answer: (B)

Explanation:

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :