解题思路:通过递归,分别求出树的左子树与右子树的深度,然后比较获得最大的深度并返回之即可。
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public int TreeDepth(TreeNode root) {
if(root == null){
return 0;
}
int leftDepth = TreeDepth(root.left);
int rightDepth = TreeDepth(root.right);
return 1 + (leftDepth > rightDepth ? leftDepth : rightDepth);
}
}
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
int TreeDepth(TreeNode* pRoot)
{
if(pRoot == nullptr){
return 0;
}
int leftDepth = TreeDepth(pRoot -> left);
int rightDepth = TreeDepth(pRoot -> right);
return 1 + (leftDepth > rightDepth ? leftDepth : rightDepth);
}
};