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) {
int left = 0;
int right = 0;
if(root == null){
return 0;
}
if(root.left != null && root.right != null){
left = maxDepth(root.left);
right = maxDepth(root.right);
return (left>right?(left+1):(right+1));
}
else if(root.left != null && root.right == null){
return maxDepth(root.left)+1;
}
else if(root.left == null && root.right != null){
return maxDepth(root.right)+1;
}
return 1;
}
}