Description:
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.
/**
* 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;
}else if (root.left == null && root.right == null) {
return 1;
}else {
int left = maxDepth(root.left);
int right = maxDepth(root.right);
return 1 + (Math.max(left,right));
}
}
}
使用思路就是用递归不停的取当前所在element左边以及右边的最大值
return 1 + max(n左,n右)