C++ related question. No code needed just written response needed

We know that the height of an empty tree as 0 and the height of a nonempty tree as the number of nodes on the longest root-to-leaf path. What is the minimum height of a binary tree that contains 31 nodes? What is the maximum height of a binary tree that contains 31 nodes? Same question as (a) for a binary search tree. Same question as (b) for a binary search tree.