A. Write 3n − (k + 5) in prefix notation: ????.
b. If T is a binary tree with 100 vertices, its minimum height is ????.
c. Every full binary tree with 50 leaves has ???? vertices.
Write in prefix notation, find minimum height of a binary tree, find number of vertices in a binary tree.