Finding the subtree with maximum imbalance.
This was given in the written test for Goldman Sach and I have solved this question in O(n) time complexity, as per my knowledge. If any one could do better or would require my code. Contact me at pushpita1988@gmail.com . I cannot attach the c code here.