/* 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 == NULL) { return 0; } int left_deep = TreeDepth(pRoot->left); // 递归获取左子树的深度 int right_deep = TreeDepth(pRoot->right); // 递归获取右子树的深度 return max(left_deep, right_deep) + 1; // 获取最大值+1 } };