# Binary trees

Not what you're looking for?

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.

##### Purchase this Solution

##### Solution Summary

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

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.