-
Notifications
You must be signed in to change notification settings - Fork 0
/
104. Maximum Depth of Binary Tree.cpp
59 lines (40 loc) · 1.36 KB
/
104. Maximum Depth of Binary Tree.cpp
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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include<iostream>
#include<vector>
using namespace std;
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:
void calculateDepthOfTree(TreeNode* node,int currentDepth){
// check if this is a leaf node
if(node->left == nullptr && node->right == nullptr){
// We mark this as depth of tree, only if it's greater
// than older depth
depth = max(depth,currentDepth);
return;
}
// continue dfs on left and right nodes
// (if they exist)
if(node->left){
calculateDepthOfTree(node->left,currentDepth+1);
}
if(node->right){
calculateDepthOfTree(node->right,currentDepth+1);
}
}
int maxDepth(TreeNode* root) {
if(!root){
return 0;
}
calculateDepthOfTree(root,1);
return depth;
}
private:
int depth = 1;
};