题意:求出树每一层最右边的元素。
思路:BFS,记录每一层的结点,输出最后一个结点。
/**
* 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 {
public:
vector<int> re;
vector<int> rightSideView(TreeNode* root) {
if(root == NULL) return re;
vector<TreeNode*> t;
t.push_back(root);
bfs(t);
return re;
}
void bfs(vector<TreeNode*> l) {
if(l.size() == 0) return;
re.push_back(l[l.size() - 1]->val);
vector<TreeNode*> temp;
for(int i = 0; i < l.size(); ++ i) {
if(l[i] == NULL) continue;
if(l[i]->left != NULL) temp.push_back(l[i]->left);
if(l[i]->right != NULL) temp.push_back(l[i]->right);
}
bfs(temp);
return;
}
};