-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathFind Largest Value in Each Tree Row.cpp
49 lines (40 loc) · 1.33 KB
/
Find Largest Value in Each Tree Row.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
/*
Solution by Rahul Surana
***********************************************************
Given the root of a binary tree, return an array of the largest value in each row of the tree (0-indexed).
***********************************************************
*/
/**
* 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:
static constexpr auto fast_io = [](){ std::ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL); };
vector<int> largestValues(TreeNode* root) {
vector<int> ans;
if(!root) return ans;
queue<TreeNode*>q;
q.push(root);
while(!q.empty()){
int mx = INT_MIN;
int s = q.size();
while(s--){
auto x = q.front();
q.pop();
mx = max(mx,x->val);
if(x->left) q.push(x->left);
if(x->right) q.push(x->right);
}
ans.push_back(mx);
}
return ans;
}
};