UGC NET CS 2007 June-Paper-2
October 13, 2023UGC NET CS 2007 June-Paper-2
October 13, 2023UGC NET CS 2007 June-Paper-2
| Question 3 |
The maximum number of nodes in a binary tree of depth 10 :
| 1024 | |
| 210 – 1 | |
| 1000 | |
| None of the above |
Question 3 Explanation:
→ The depth of binary tree starts from 0 but not 1.
→ To find maximum number of nodes in a binary tree of depth using formula is
= 2h+1 -1
= 211 -1
= 2048-1
= 2047
→ To find maximum number of nodes in a binary tree of depth using formula is
= 2h+1 -1
= 211 -1
= 2048-1
= 2047
Correct Answer: D
Question 3 Explanation:
→ The depth of binary tree starts from 0 but not 1.
→ To find maximum number of nodes in a binary tree of depth using formula is
= 2h+1 -1
= 211 -1
= 2048-1
= 2047
→ To find maximum number of nodes in a binary tree of depth using formula is
= 2h+1 -1
= 211 -1
= 2048-1
= 2047