https://leetcode.com/problems/binary-tree-right-side-view/

Author: harshitgindra

LeetCodeSolutions/ArrayAndString/Rotate Array.cs

@@ -38,7 +38,7 @@ private void Helper(int[] arry, int start, int end)
         }
 
         [Test(Description = "https://leetcode.com/problems/rotate-array/")]
-        [Category("Easy")]
+        [Category("Medium")]
         [Category("LeetCode")]
         [Category("Rotate Array")]
         [TestCaseSource(nameof(Input))]

LeetCodeSolutions/BinaryTreeBfs/BinaryTreeRightSideView.cs

@@ -0,0 +1,40 @@
+namespace LeetCode.MediumProblems;
+
+public class BinaryTreeRightSideView
+{
+    public IList<int> RightSideView(TreeNode root) {
+        var dict = new Dictionary<int, int>();
+        _Helper(root, 1, dict);
+        return dict.Values.ToList();
+    }
+
+    private void _Helper(TreeNode node, int depth, Dictionary<int, int> result )
+    {
+        if (node != null)
+        {
+            result[depth] = node.val;
+            _Helper(node.left, depth + 1, result );
+            _Helper(node.right, depth + 1, result );
+        }
+    }
+    
+    [Test(Description = "https://leetcode.com/problems/binary-tree-right-side-view/")]
+    [Category("Medium")]
+    [Category("LeetCode")]
+    [Category("Binary Tree Right Side View")]
+    [TestCaseSource(nameof(Input))]
+    [Category("Binary Tree BFS")]
+    [Category("TopInterview")]
+    public void Test1((List<int> Output, int?[] Input) item)
+    {
+        var response = RightSideView(item.Input.ToTreeNode());
+        Assert.That(response, Is.EqualTo(item.Output));
+    }
+
+    public static IEnumerable<(List<int> Output, int?[] Input)> Input =>
+        new List<(List<int> Output, int?[] Input)>()
+        {
+            ([1,3,4], [1,2,3,null,5,null,4]),
+            ([1,3,4, 5], [1,2,3,4,null,null,null,5]),
+        };
+}

README.md

@@ -134,7 +134,7 @@ The Top Interview 150 collection on Leetcode is a curated set of 150 interview q
 | 80                                           | Count Complete Tree Nodes                                                                                 | Easy       |   ✅     |
 | 81                                           | Lowest Common Ancestor of a Binary Tree                                                                   | Medium     |        |
 | <br>        Binary Tree BFS<br>              |                                                                                                           |            |        |
-| 8282                                         | Binary Tree Right Side View                                                                               | Medium     |        |
+| 199                                         | Binary Tree Right Side View                                                                               | Medium     |    ✅    |
 | 83                                           | Average of Levels in Binary Tree                                                                          | Easy       |    ✅    |
 | 84                                           | Binary Tree Level Order Traversal                                                                         | Medium     |        |
 | 85                                           | Binary Tree Zigzag Level Order Traversal                                                                  | Medium     |        |