For a perfect binary tree of height h, having N nodes, the sum of heights of nodes is? (A) N – (h – 1) (B) N – (h + 1) (C) N – 1 (D) N – 1 + h►Correct Option Correct Option is: B