FIND THE ANSWERS

Prove with induction the total number of nodes in a tree is 2n-1. let T be a tree where each node had 0 or 2 childen. if T is >= 1 leaves?

Answer this question

  • Prove with induction the total number of nodes in a tree is 2n-1. let T be a tree where each node had 0 or 2 childen. if T is >= 1 leaves?


Answers