题解 | #二叉树的深度#
二叉树的深度
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 TreeDepth(TreeNode* pRoot) { return RecursionGetDepth(pRoot); } private: int RecursionGetDepth(TreeNode* root) { int leftDepth, rightDepth; if (root == nullptr) { return 0; } else { leftDepth = RecursionGetDepth(root->left); //递归 rightDepth = RecursionGetDepth(root->right); return leftDepth > rightDepth ? (leftDepth + 1) : (rightDepth + 1); //返回较深的一棵子树 } } };