-
-
Notifications
You must be signed in to change notification settings - Fork 11
/
code.cpp
52 lines (48 loc) · 1.27 KB
/
code.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
#include <iostream>
#include <vector>
#include <queue>
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:
int widthOfBinaryTree(TreeNode *root)
{
if (root == NULL)
return 0;
queue<pair<TreeNode *, int>> q; // node, horizontal distance
q.push({root, 0});
int ans = 1;
while (!q.empty())
{
int size = q.size();
int startInd = q.front().second;
int endInd = q.back().second;
ans = max(endInd - startInd + 1, ans);
for (int i = 0; i < size; i++)
{
auto front = q.front();
q.pop();
TreeNode *node = front.first;
int dist = front.second - startInd;
if (node->left)
q.push({node->left, 2LL * dist + 1});
if (node->right)
q.push({node->right, 2LL * dist + 2});
}
}
return ans;
}
};
int main()
{
return 0;
}