Add solution #199

Author: JoshCrozier

README.md

@@ -151,6 +151,7 @@
 190|[Reverse Bits](./0190-reverse-bits.js)|Easy|
 191|[Number of 1 Bits](./0191-number-of-1-bits.js)|Easy|
 198|[House Robber](./0198-house-robber.js)|Medium|
+199|[Binary Tree Right Side View](./0199-binary-tree-right-side-view.js)|Medium|
 202|[Happy Number](./0202-happy-number.js)|Easy|
 203|[Remove Linked List Elements](./0203-remove-linked-list-elements.js)|Easy|
 204|[Count Primes](./0204-count-primes.js)|Medium|

solutions/0199-binary-tree-right-side-view.js

@@ -0,0 +1,27 @@
+/**
+ * 199. Binary Tree Right Side View
+ * https://leetcode.com/problems/binary-tree-right-side-view/
+ * Difficulty: Medium
+ *
+ * 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.
+ */
+
+/**
+ * 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, result = [], depth = 0) {
+  if (!root) return result;
+  result[depth] = root.val;
+  rightSideView(root.left, result, depth + 1);
+  return rightSideView(root.right, result, depth + 1);
+};