给定一棵二叉树,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
示例:
输入: [1,2,3,null,5,null,4] 输出: [1, 3, 4] 解释: 1 <--- / \ 2 3 <--- \ \ 5 4 <---
打卡,DFS
#include <iostream>
#include <vector>
using namespace std;
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> vec;
DFS(root,0,vec);
return vec;
}
private:
void DFS(TreeNode *root, int step, vector<int> &vec){
if(root==NULL)
return;
if(vec.size()==step){
vec.push_back(root->val);
}
DFS(root->right,step+1,vec);
DFS(root->left,step+1,vec);
}
};