Show that the maximum number of nodes in a binary tree of height h is 2h+1 − 1
Answers
Answered by
0
H+1-10 is ur answer friend
Similar questions