Question

Prove that the number of vertices n in a binary tree is always odd.

Answer 1

This would result in the tree having an odd number of vertices (1). Correct. Inductive hypothesis: A complete binary tree with a height greater than 0 and less than k has an odd number of vertices. Prove: A binary tree with a height of k+1 would have an odd number of vertices.

HOPE IT HELPS YOU

PLEASE MARK ME AS BRAINLIEST