剑指Offer——JZ38.二叉树的深度

题目传送门

---

---

题解

• sb题，很少bb

---

AC-Code

/* 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)    return 0;
        int ldeep = TreeDepth(pRoot->left);
        int rdeep = TreeDepth(pRoot->right);
        return max(ldeep, rdeep) + 1;
    }
};