FizzBuzz Tree Challenge Traverse a binary tree, and return the highest value within the tree. Approach & Efficiency BigO: Time: O(n) Space: O(H), H = Height of call stack Solution
