Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Programming and Data Structure Tree Complete Binary Tree
Match the column A with the items present in column B:
| Column A: |
Column B: |
| 1. Maximum size of an array to store a binary tree with 'n' nodes | p. log2n |
| 2. Maximum height possible for a binary tree with 'n' nodes | q. 2n-1 |
| 3. Minimum height possible for a binary tree with 'n' nodes | r. n |
1
1-q, 2-p, 3-r
2
1-p, 2-r, 3-q
3
1-q, 2-r, 3-p
4
1-p, 2-q, 3-r
5
Question Not Attempted