algorithm/Week_03/id_121/LeetCode_104_121.java at master · feixiangcode/algorithm · GitHub

30 lines (30 loc) · 641 Bytes

/**

* Definition for a binary tree node.

* public class TreeNode {

* int val;

* TreeNode left;

* TreeNode right;

* TreeNode(int x) { val = x; }

* }

class Solution {

private int max = 0;

public int maxDepth(TreeNode root) {

if(root == null){

return 0;

}

findMax(root,0);

return max;

}

private void findMax(TreeNode root,int depth){

if(root == null){

if(depth > max){

max = depth;

}

return ;

}

depth ++;

findMax(root.left,depth);

findMax(root.right,depth);

}

Expand file tree