原题链接:https://leetcode.com/problems/maximum-depth-of-binary-tree/
题意:求二叉树的深度
/**
* 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 left = maxDepth(root.left);
int right = maxDepth(root.right);
return Math.max(left, right) + 1;
}
}
解题思路:递归法,返回左右子树中深度大的并+1,作为自己的深度
画个图可能更容易理解: