题解 | 二叉树的深度
二叉树的深度
https://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 cnt = 0;
int TreeDepth(TreeNode* pRoot) {
// 根节点为空没有高度
if(pRoot == nullptr) return 0;
// 树高为左右子树高较大的那个加1
return max(TreeDepth(pRoot->left),TreeDepth(pRoot->right))+1;
}
};
