题解 | #二叉树的深度#

/*
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;
		}
		int l_val=TreeDepth(pRoot->left);
		int r_val=TreeDepth(pRoot->right);
		return 1+(l_val>r_val?l_val:r_val);
    }
};