题目描述:输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
思路:分别递归求左右子树的深度,然后比较得到较大的那个值,再加1;
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 left = TreeDepth(pRoot->left);
int right = TreeDepth(pRoot->right);
int _TreeDepth = max(left, right) + 1;
return _TreeDepth;
}
};