1. You are given a partially written BST class. 2. You are required to complete the body of size, sum, max, min and find function. The functions are expected to 2.1. size - return the number of nodes in BST 2.2. sum - return the sum of nodes in BST 2.3. max - return the value of node with greatest value in BST 2.4. min - return the value of node with smallest value in BST 2.5. find - return true if there is node in the tree equal to "data" 3. Input and Output is managed for you.
Input Format
Input is managed for you
Output Format
Output is managed for you
Constraints
None
Example
Input
15 50 25 12 n n 37 n n 75 62 n n 87 n n 62
Output
7 348 87 12 true