leetcode515.FindLargestValueinEachTreeRow二叉树每一层最大值+广度优先遍历BFS

You need to find the largest value in each row of a binary tree.

Example:
Input:

1/ \3 2/ \ \ 5 3 9


Output: [1, 3, 9]

本题题意很简单&＃xff0c;就是做一个BFS广度优先遍历&＃xff0c;

代码如下&＃xff1a;

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include using namespace std;/*
struct TreeNode
{int val;TreeNode *left;TreeNode *right;TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
*/class Solution
{
public:vector<int> largestValues(TreeNode* root){vector<int> res;if (root &＃61;&＃61; NULL)return res;queue que;que.push(root);while (que.empty() &＃61;&＃61; false){int size &＃61; que.size();int maxNum &＃61; que.front()->val;for (int i &＃61; 0; i val);que.pop();if (one->left !&＃61; NULL)que.push(one->left);if (one->right !&＃61; NULL)que.push(one->right);}res.push_back(maxNum);}return res;}
};