dnshi
diff --git a/‎README.md
Lines changed: 1 addition & 0 deletions b/‎README.md
Lines changed: 1 addition & 0 deletions
diff --git a/‎algorithms/BinaryTreeRightSideView.js
Lines changed: 68 additions & 0 deletions b/‎algorithms/BinaryTreeRightSideView.js
Lines changed: 68 additions & 0 deletions
@@ -128,6 +128,7 @@
 |205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [JavaScript](./algorithms/IsomorphicStrings.js)|Easy|
 |203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [JavaScript](./algorithms/RemoveLinkedListElements.js)|Easy|
 |202|[Happy Number](https://leetcode.com/problems/happy-number/)| [JavaScript](./algorithms/HappyNumber.js)|Easy|
+|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)|[JavaScript](algorithms/BinaryTreeRightSideView.js)|Medium|
 |191|[Number of 1 Bits](https://oj.leetcode.com/problems/number-of-1-bits/)| [JavaScript](./algorithms/NumberOf1Bits.js)|Easy|
 |190|[Reverse Bits](https://oj.leetcode.com/problems/reverse-bits/)| [JavaScript](./algorithms/ReverseBits.js)|Easy|
 |172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)|[JavaScript](./algorithms/FactorialTrailingZeroes.js)|Easy|
 
@@ -0,0 +1,68 @@
+// Source : https://leetcode.com/problems/binary-tree-right-side-view
+// Author : Dean Shi
+// Date   : 2021-11-09
+
+/***************************************************************************************
+ * Given the root of 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.
+ * 
+ * Example 1:
+ * 
+ * Input: root = [1,2,3,null,5,null,4]
+ * Output: [1,3,4]
+ * 
+ * Example 2:
+ * 
+ * Input: root = [1,null,3]
+ * Output: [1,3]
+ * 
+ * Example 3:
+ * 
+ * Input: root = []
+ * Output: []
+ * 
+ * Constraints:
+ * 
+ * The number of nodes in the tree is in the range [0, 100].
+ * -100 <= Node.val <= 100
+ * 
+ * 
+ ***************************************************************************************/
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number[]}
+ */
+var rightSideView = function(root) {
+    if (!root) return []
+
+    const result = [root.val]
+
+    let currLevel = [root]
+    while((currLevel = BFSParse(currLevel)).length > 0) {
+        result.push(currLevel[currLevel.length - 1].val)
+    }
+
+    return result
+};
+
+function BFSParse(queue) {
+    const result = []
+    for (let item of queue) {
+        if (item.left) {
+            result.push(item.left)
+        }
+        if (item.right) {
+            result.push(item.right)
+        }
+    }
+    return result
+}