Consider the height of a tree as the number of edges in the longest path between the root node and leaf nodes. If T is a binary tree of height 3, then what is the smallest and largest number of nodes that T can have?
1
Smallest: 3, Largest: 15
2
Smallest: 4, Largest: 7
3
Smallest: 4, Largest: 15
4
Smallest: 3, Largest: 7