题目:
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]
.
题解:
解题重点在于判断此结点是不是最右边的结点,通过比较result.size()是否小于value,因为value初始值为1,之后依次加一,先递归的是root->right,如果在递归root->left的过程中,出现result的大小比value小,则是出现了比右子树更长的值。
答案:
/**
* Definition for a binary tree node.88
* 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> result;
int value=1;
f(root,value,result);
return result;
}
void f(TreeNode* root,int value,vector<int>& result)
{
if(root==NULL)
return;
if(result.size()<value)
result.push_back(root->val);
f(root->right,value+1,result);
f(root->left,value+1,result);
}
};