UTC 9 DEC 872. Leaf-Similar Trees

class Solution {
public:
    int diff = INT_MIN; // we want max difference
    
    void getMax(TreeNode *root, int mx, int mi){
        
        if(!root) return;
        
        // track minimum and maximum while going through a sequence or path
        mx = max(mx, root->val);
        mi = min(mi, root->val);
        
        diff = max(diff, mx - mi); // store maximum difference
        
        getMax(root->left,mx,mi);
        getMax(root->right,mx,mi);
    }
    
    int maxAncestorDiff(TreeNode* root) {
        
        if(!root) return 0;
        
        int mx = INT_MIN, mi = INT_MAX;

        getMax(root,mx,mi);
        
        return diff;
    }
};