题解 | #二叉树的深度#

/*
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;
        }

        return TreeDepth(pRoot->left) > TreeDepth(pRoot->right) ? TreeDepth(
                   pRoot->left) + 1 : TreeDepth(pRoot->right) + 1;
    }
};