readMe.md

Given a binary tree, find the Maximum node Value in it.

Input : Root of below tree
            1
          /   \
         2      3
        / \    / \ 
       4   5  6   7
                   \
                    8
Output : 8

Input : Root of below tree
            12
          /   \
         2      3
               / 
              1  
Output : 12