Video solution will be uploaded soon.
Which of the followings are true for a complete binary tree?A. It always has odd number of vertices. B. With n internal vertices, it has n+1 leaves. C. With l leaves it has l-1 internal vertices. D. With 2n-1 vertices, it has n leaves. | Watch the step-by-step video solution for this NIMCET PYQ.