Question

Prove that a reguler binary tree has of odd number of vertics

Answer 1

Answer:

Prove: A binary tree with a height of k+1 would have an odd number of vertices. A complete binary tree with a height of k+1 will be made up of two complete binary trees k1 and k2. K1 and K2 are both complete binary trees meaning they have an odd number of vertices. They can be represented by (2m+1) and (2n+1).