给定一个二叉树的 根节点 root
,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
示例 1:
输入: [1,2,3,null,5,null,4] 输出: [1,3,4]
示例 2:
输入: [1,null,3] 输出: [1,3]
示例 3:
输入: [] 输出: []
提示:
- 二叉树的节点个数的范围是
[0,100]
-100 <= Node.val <= 100
DFS:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
void dfs(TreeNode* root, vector<int>& right) {
if (!root) {
return;
}
right.push_back(root->val);
if (root->right) {
dfs(root->right, right);
return;
}
dfs(root->left, right);
}
vector<int> rightSideView(TreeNode* root) {
vector<int> right_vals;
dfs(root, right_vals);
return right_vals;
}
};
BFS:
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
vector<int> right_vals;
if (!root) {
return right_vals;
}
queue<TreeNode*> nodes;
nodes.push(root);
while (!nodes.empty()) {
int n = nodes.size();
for (int i = 0; i < n; i++) {
auto node = nodes.front();
if (i == n-1) {
right_vals.push_back(node->val);
}
if (node->left) {
nodes.push(node->left);
}
if (node->right) {
nodes.push(node->right);
}
nodes.pop();
}
}
return right_vals;
}
};