...
Access-Control-Methods
October 8, 2024
KVS 22-12-2018 Part-B
October 9, 2024
Access-Control-Methods
October 8, 2024
KVS 22-12-2018 Part-B
October 9, 2024

UGC NET CS 2013 Sep-paper-2

Question 11
The minimum number of nodes in a binary tree of depth d (root is at level 0) is
A
2d – 1
B
2d + 1 – 1
C
d + 1
D
d
Question 11 Explanation: 
Binary tree is a tree where each node has at most 2 children nodes.
Properties:
→The number of nodes at depth d in a perfect binary tree = 2d
→A perfect binary tree of height h has 2h+1 -1 nodes
→Number of leaf nodes in a perfect binary tree of height h = 2h
→Number of internal nodes in a perfect binary tree of height h = 2h -1
→The minimum number of nodes in a binary tree of height h = h+1
→The maximum number of nodes in a binary tree of height h = 2h+1 -1
Correct Answer: C
Question 11 Explanation: 
Binary tree is a tree where each node has at most 2 children nodes.
Properties:
→The number of nodes at depth d in a perfect binary tree = 2d
→A perfect binary tree of height h has 2h+1 -1 nodes
→Number of leaf nodes in a perfect binary tree of height h = 2h
→Number of internal nodes in a perfect binary tree of height h = 2h -1
→The minimum number of nodes in a binary tree of height h = h+1
→The maximum number of nodes in a binary tree of height h = 2h+1 -1
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x