binary-tree-right-side-view: C++ implementation (azl397985856#36)

Author: raof01

problems/199.binary-tree-right-side-view.md

@@ -42,6 +42,9 @@ Explanation:
 
 ## 代码
 
+* 语言支持：JS，C++
+
+Javascript Code:
 ```js
 /*
  * @lc app=leetcode id=199 lang=javascript
@@ -115,6 +118,38 @@ var rightSideView = function(root) {
   return ret;
 };
 ```
+C++ Code:
+```C++
+/**
+ * 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) {
+        auto ret = vector<int>();
+        if (root == nullptr) return ret;
+        auto q = queue<const TreeNode*>();
+        q.push(root);
+        while (!q.empty()) {
+            auto sz = q.size();
+            for (auto i = 0; i < sz; ++i) {
+                auto n = q.front();
+                q.pop();
+                if (n->left != nullptr ) q.push(n->left);
+                if (n->right != nullptr ) q.push(n->right);
+                if (i == sz - 1) ret.push_back(n->val);
+            }
+        }
+        return ret;
+    }
+};
+```
 
 ## 扩展