题解 | #二叉树的深度#

/*
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) {
        static int b=0,a=0;
        if(pRoot)
        {
            a++;
        if(pRoot->left)
        TreeDepth(pRoot->left);
        if(pRoot->right)
        TreeDepth(pRoot->right);
        if(a>=b)
        b=a;
        a--;
        return b;
        }
        return b;
    
    }
};