剑指offer 038、二叉树的深度 题目 题解 class Solution { public: int TreeDepth(TreeNode* pRoot) { if (!pRoot) return 0; int left = TreeDepth(pRoot->left); int right = TreeDepth(pRoot->right); return max(left, right) + 1; } };