A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves:
1
cannot have more than 37 nodes
2
has exactly 37 nodes
3
has exactly 35 nodes
4
cannot have more than 35 nodes