题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
链接
代码
/*
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)
{
int deep = 1;
int ans = 1;
if(pRoot == NULL){
return 0;
}
DFS(pRoot, deep, ans);
return ans;
}
void DFS(TreeNode* pRoot, int deep, int& ans){
if(pRoot->left == NULL && pRoot->right == NULL){
if(deep > ans){
ans = deep;
}
}
else{
if(pRoot->left){
DFS(pRoot->left, deep+1, ans);
}
if(pRoot->right){
DFS(pRoot->right, deep+1, ans);
}
}
}
};