97 · 二叉树的最大深度
方法1:DFS
public int maxDepth(TreeNode root) {
// write your code here
return root==null?0:Math.max(maxDepth(root.left),maxDepth(root.right))+1;
}
public int maxDepth(TreeNode root) {
// write your code here
return root==null?0:Math.max(maxDepth(root.left),maxDepth(root.right))+1;
}