二叉树的右视图（BFS）

很简单，直接上代码：

class Solution {
public:
	vector<int> rightSideView(TreeNode* root) {
		if (root == NULL)return{};
		vector<int>res;
		queue<TreeNode*>myqueue;
		myqueue.push(root);
		while (!myqueue.empty())
		{
			int len = myqueue.size();
			for (int i = 0; i < len; i++)
			{
				TreeNode*top = myqueue.front();
				myqueue.pop();
				if (i == len - 1)
				{
					res.push_back(top->val);
				}
				if (top->left != NULL)
					myqueue.push(top->left);
				if (top->right != NULL)
					myqueue.push(top->right);

			}
		}
		return res;

	}
};