Number of nodes in a complete binary tree of depth k is
Answers
Answered by
0
Answer:The maximum number of nodes in a binary tree of depth k is 2k−1, k≥1. Here the depth of the tree is 1. So according to the formula, it will be 21−1=1. But we have 3 nodes here
Step-by-step explanation:
Answered by
1
Answer:
The maximum number of nodes in a binary tree of depth k is 2k−1, k≥1. Here the depth of the tree is 1. So according to the formula, it will be 21−1=1. But we have 3 nodes here...............................
Similar questions