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.

`
    /**
  Definition for a binary tree node.
  public class TreeNode {
      int val;
     TreeNode left;
      TreeNode right;
     TreeNode(int x) { val = x; }
  }
 */
public class Solution {
    public int maxDepth(TreeNode root) {
        if (root == null)
            return 0;
        int leftd = 0, rightd = 0, max  = 1;
        if (root.left != null)
            leftd = 1 + maxDepth(root.left);
        if (root.right != null)
            rightd = 1 + maxDepth(root.right);
        int result = Math.max(leftd, rightd);
        return Math.max(result, max);
    }
}

`

这道题是求树的最大深度，对树我们一般采用递归的思想，基本思想是，从根节点出发，遍历左右子树，每次返回的值是左右子树深度中的最大值，这样回到根节点时就可以知道最大深度了。
根节点出发时，深度为1，有左节点那么就记录左节点当前的深度为1，对有右节点的也同理，到达最底部时，因为没有左右节点了，那么只能返回max = 1。