輸入一棵二叉樹,求該樹的深度。從根結點到葉結點依次經過的結點(含根、葉結點)形成樹的一條路徑,最長路徑的長度爲樹的深度。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
//以pRoot爲根的深度
int TreeDepth(TreeNode* pRoot)
{
if(pRoot==NULL)return 0;
int count_left=TreeDepth(pRoot->left);
int count_right=TreeDepth(pRoot->right);
return max(count_left,count_right)+1;
}
};