Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
Solution：遞歸post-order dfs來upwards累積
Time Complexity: O(N) Space Complexity: O(N) 遞歸緩存
Solution Code：
class Solution {
public int maxDepth(TreeNode root) {
if(root == null) return 0;
return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
}
}
