Given a Binary Tree in which every internal node (non-leaf node)has exactly 2 child nodes. Prove the height of the tree is at most(n-1)/2 where n is the number of nodes in the tree, and n ? 1, byinduction.
Expert Answer
An answer will be send to you shortly. . . . .