Binary Tree Right Side View
原题链接Binary Tree Right Side View
从右向左观察一棵二叉树,返回能看到的元素
遍历一遍即可,只记录靠右的元素
代码如下
/**
* 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) {