a ) Find the length of the left path b ) Find the length of the right path Return the maximum of left path and right path
return max ( maxPathLenUtil ( root . left , curr_val , prev_len + 1 ) , maxPathLenUtil ( root . right , curr_val , prev_len + 1 ) ) NEW_LINE