104. Maximum Depth of Binary Tree

104. Maximum Depth of Binary Tree
     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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

3

/
9 20
/
15 7
return its depth = 3.
java

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int maxDepth(TreeNode root) {
        if(root==null)
            return 0;
        if(root.left == null && root.right == null)
            return 1;
        return dfs(root);
    }
    private int dfs(TreeNode l){
        if(l == null)
            return 0;
        return 1+Math.max(dfs(l.right),dfs(l.left));
    }
}

python

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        if root == None:
            return 0
        return self.dfs(root)
    def dfs(self,root):
        if root == None:
            return 0
        return 1+max(self.dfs(root.left),self.dfs(root.right))