/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
int depth=0;
int max=0;
public int TreeDepth(TreeNode root) {
if(root ==null){
return 0;
}
depth++;
TreeDepth(root.left);
if(depth > max){
max=depth;
}
TreeDepth(root.right);
if(depth > max){
max=depth;
}
depth--;
return max;
}
}
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
int depth=0;
int max=0;
public int TreeDepth(TreeNode root) {
if(root ==null){
return 0;
}
depth++;
TreeDepth(root.left);
if(depth > max){
max=depth;
}
TreeDepth(root.right);
if(depth > max){
max=depth;
}
depth--;
return max;
}
}