Implement `treeMax(root)` returning the largest value in the tree, or `null` for an empty tree.
+ 1 hidden test run on Submit.
The max is the node value compared against the non-null subtree maxima. O(n).
Run your code to see results.