Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Binary Heap Binary Search Tree
Which of the followings are true for a complete binary tree ?
A. It has always odd number of vertices.
B. With i internal vertices, it has i + 1 leaves.
C. With ℓ leaves it has ℓ - 1 vertices.
D. With 2n - 1 vertices, it has n leaves.
Choose the correct answer from the options given below :
1
A, B, C Only
2
B, C Only
3
A, D Only
4
A, B, C, D