leetcode#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

思路
树的题一般就两种方法
dfs 深度优先
bfs 广度优先 breath first seaerch

/**
 * 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;
        return helper(root);
    }
    public int helper(TreeNode root){
        if(root == null) return 0;
        int left = helper(root.left);
        int right = helper(root.right);
        return Math.max(left, right) + 1; 
        //从左后一个开始赋值， 到达叶节点返回值为0 上一个节点就为 0+1 再上一层就是 0+1+1一直判断到第二层，
        //判断左右子树哪个更深 返回+1
        
    }
}