题解 | #二叉树的深度#

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
#include <utility>
class Solution {
public:
    int TreeDepth(TreeNode* pRoot) {
		if(pRoot==nullptr) return 0;
		getDepth(pRoot, 1);
		return result;
    }

private:
	int result;
	void getDepth(TreeNode* root, int depth){
		result = result>depth ?result :depth;
		if(root->left){
			depth++;
			getDepth(root->left, depth);
			depth--;
		}
		if(root->right){
			depth++;
			getDepth(root->right, depth);
			depth--;
		}

	}
};