IMWeb提升营Day7 | 训练题38：二叉树的深度

题目描述

思路：DFS 递归

/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
/*
* 思路：DFS,递归搜索
*/
class Solution {
public:
int TreeDepth(TreeNode* pRoot)
{
if(pRoot == NULL) return 0;
return max(1+TreeDepth(pRoot->left),1+TreeDepth(pRoot->right));
}
};