LeetCode 199. Binary Tree Right Side View 题解

199. Binary Tree Right Side View

 

Question Editorial Solution

  My Submissions

• Total Accepted: 59906
• Total Submissions: 158112
• Difficulty: Medium
• Contributors: Admin

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

For example:
Given the following binary tree,

   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---

You should return [1, 3, 4].

解题思路：

本题即使用宽度优先遍历。和层次遍历类似，对于父节点，首先将其右子节点加入队列，然后加入其左子节点。对于每一层，只将第一个遍历到的点的值加入结果即向量ans。

代码展示：

/**
 * 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> rightSideView(TreeNode* root) {
		vector<int> ans;
		if(!root) return ans;
		queue<TreeNode *> q;		
		q.push(root);
		int node_num =1; //记录每一层的结点数目，初始值为1，即为根节点所在层
		while(!q.empty())
		{
			int tmp_num = node_num;
			node_num=0;
			for(int i=0;i<tmp_num;i++)
			{
				TreeNode* tmp = q.front();
				if(i==0) ans.push_back(tmp->val);
				q.pop();
				if(tmp->right)
				{
					q.push(tmp->right);
					node_num++;
				}
				if(tmp->left)
				{
					q.push(tmp->left);
					node_num++;
				}
				
			}						
		}
		return ans;
    }
};