题解 | #二叉树的深度#
二叉树的深度
http://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b
/*
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;
//在当前结点的左右子树的深度基础上加1
return ( TreeDepth(pRoot->left)>TreeDepth(pRoot->right)?
TreeDepth(pRoot->left):TreeDepth(pRoot->right) ) + 1;
}
};
