Given a Binary Tree without having to create it, find the maximum value of a the tree.
Need to traverse the tree completly, don't need to keep track of any value, just traverse and record. Second funfction should compare values of the tree, not using built in methods to do so.
Traverse and record values of the tree, after recorded, compare values and return the greatest value.