Maximum Depth of Binary Tree

Desicription

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
private:
int res = 0;
void findMaxDepth(TreeNode* root, int level) {
if(root == NULL)
return ;
res = max(res, level);
findMaxDepth(root->left, level+1);
findMaxDepth(root->right, level+1);
}
public:
int maxDepth(TreeNode* root) {
findMaxDepth(root, 1);
return res;
}
};