题解 | #JZ55 二叉树的深度#

//树深度为左右子树最大深度加1
/*
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;	//空树深度为0
        
        int leftDep = TreeDepth(pRoot->left);
        int rightDep = TreeDepth(pRoot->right);
        
        return 1 + max(leftDep, rightDep);	//当前树深度为左右子树最大深度加1
    }
};