题解 | #二叉树的深度#

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 lev=TreeDepth(pRoot->left);
        //右子树深度
        int rev=TreeDepth(pRoot->right);
        return max(lev,rev)+1;
    }
};