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 , cur_val , prev_len + 1 ) , maxPathLenUtil ( root -> right , cur_val , prev_len + 1 ) ) ; }