-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path543. Diameter of Binary Tree.cpp
89 lines (57 loc) · 1.4 KB
/
543. Diameter 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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
/**
* 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 {
int height(TreeNode *root) {
if(!root)
return 0;
return 1 + max(height(root->left), height(root->right));
}
int getdiameter(TreeNode* root) {
if(!root)
return 0;
int left = height(root->left);
int right = height(root->right);
int ldia = getdiameter(root->left);
int rdia = getdiameter(root->right);
int ans = max(left+right, ldia);
ans = max(ans, rdia);
return ans;
}
public:
int diameterOfBinaryTree(TreeNode* root) {
return getdiameter(root);
}
};
------------
/**
* 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 {
int ans = 0;
int getdiameter(TreeNode* root) {
if (!root)
return 0;
int left = getdiameter(root->left);
int right = getdiameter(root->right);
ans = max(ans, left+right);
return 1 + max(left, right);
}
public:
int diameterOfBinaryTree(TreeNode* root) {
getdiameter(root);
return ans;
}
};