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.
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
private int maxdepth=0;
public int maxDepth(TreeNode root) {
if(root==null)
{
return 0;
}
else
{
deep(root,1);
return maxdepth;
}
}
private void deep(TreeNode t,int deepth){
if(t==null)
{
return;
}
else
{
if(deepth>maxdepth)
{
maxdepth=deepth;
}
deep(t.left,deepth+1);
deep(t.right,deepth+1);
}
}
}