# Binary trees

Not what you're looking for? Search our solutions OR ask your own Custom question.

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.

https://brainmass.com/math/discrete-math/binary-trees-24171

#### Solution Summary

Write in prefix notation, find minimum height of a binary tree, find number of vertices in a binary tree.

$2.49