Leetcode 199. Binary Tree Right Side View | | Leetcode 199. Binary Tree Right Side View 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution123456789101112131415161718192021222324252627282930/** * 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) { vector<int> result; traverseRight(root, result, 0); return result; }private: void traverseRight(TreeNode* root, vector<int>& result, int depth) { if(!root) { return; } depth++; if(depth > result.size()) { result.push_back(root->val); } traverseRight(root->right, result, depth); traverseRight(root->left, result, depth); }}; Reference https://leetcode.com/problems/binary-tree-right-side-view/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏