Leetcode之Binary Tree Right Side View

最新推荐文章于 2025-08-13 22:03:49 发布

原创最新推荐文章于 2025-08-13 22:03:49 发布 · 120 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode和机试题专栏收录该内容

509 篇文章

订阅专栏

本文介绍了一种算法，用于获取二叉树从顶部到底部的右侧节点值。通过两种方法实现：使用队列进行层次遍历和递归方法。示例输入为[1,2,3,null,5,null,4]，输出为[1,3,4]。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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.

Example:

Input: [1,2,3,null,5,null,4]
Output: [1, 3, 4]
Explanation:

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

代码：

方法一——queue：

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

		}
		count = temp;
	}
	return res; 
    }
};

方法二——递归方法：

/**
 * 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:
   void recursion(TreeNode *root, int level, vector<int> &res)
    {
        if(root==NULL) return ;
        if(res.size()<level) res.push_back(root->val);
        recursion(root->right, level+1, res);
        recursion(root->left, level+1, res);
    }
    
    vector<int> rightSideView(TreeNode *root) {
        vector<int> res;
        recursion(root, 1, res);
        return res;
    }
};