1. Write a recursive function that returns the height of a binary tree.
2. Write a recursive function that returns a count of the number of leaf nodes in a binary tree.
3. Assume that a given BST stores integer values in its nodes. Write a recursive function that sums the values of all nodes in the tree.