【剑指 Offer】55 - I. 二叉树的深度(详细解析)
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int max=0;
public int maxDepth(TreeNode root) {
dfs(root,1);
return max;
}
public void dfs(TreeNode node,int depth){
if(node==null) return;
//记录最大值
if(depth>max) max=depth;
dfs(node.left,depth+1);
dfs(node.right,depth+1);
}
}