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 {
public int maxDepth(TreeNode root) {
// Start typing your Java solution below
// DO NOT write main() function
if(root == null)
return 0;
else
return traversal(root, 1);
}
public int traversal(TreeNode root, int depth){
if(root == null)
return Math.max(0, depth);// actually no need to test depth < 0
int left = depth; int right = depth;
if(root.left != null)
left = traversal(root.left, left + 1);
if(root.right != null)
right = traversal(root.right, right + 1);
return Math.max(left, right);
}
}
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int maxDepth(TreeNode root) {
// Start typing your Java solution below
// DO NOT write main() function
if(root == null)
return 0;
int left = maxDepth(root.left) + 1;
int right = maxDepth(root.right) + 1;
return left > right ? left : right;
}
}