1、深度优先搜索做法
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode* root) {
int max=0,cnt=0;
dfs(root,cnt,max);
return max;
}
void dfs(TreeNode* root,int cnt,int& max)
{
if(root==NULL)
{
if(cnt>max) max=cnt;
return ;
}
++cnt;
dfs(root->left,cnt,max);
dfs(root->right,cnt,max);
return ;
}
};