Binary Trees

Suppose T is a binary tree with 14 nodes. What is the minimum possible height of T?

3

What is the minimum number of internal nodes in a binary tree with 8 nodes?

4

What is the minimum number of nodes in a full binary tree with height 3?

7

What is the minimum number of nodes in a complete binary tree with height 3?

8

Which statement is false? Every non-empty binary tree has exactly one root node Every node in a binary tree has exactly two children Every binary tree has at least one node Every non-root node in a binary tree has exactly one parent None of the above

Every binary tree has at least one node

Select the one true statement. Every binary tree is either complete or full Every complete binary tree is also a full binary tree Every full binary tree is also a complete binary tree No binary tree is both complete and full None of the above

None of the above