D. J.:

- Added the leetcode problem and solution for 199 Binary Tree Right Side View

Author: nobodyPerfecZ

README.md

@@ -58,6 +58,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [189 Rotate Array](https://leetcode.com/problems/rotate-array/description/)
 - [190 Reverse Bits](https://leetcode.com/problems/reverse-bits/description/)
 - [191 Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/description/)
+- [199 Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/description/)
 - [201 Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/description/)
 - [202 Happy Number](https://leetcode.com/problems/happy-number/description/)
 - [205 Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/description/)

awesome_python_leetcode/_199_binary_tree_right_side_view.py

@@ -0,0 +1,29 @@
+from typing import List, Optional
+
+from awesome_python_leetcode.tree import TreeNode
+
+
+class Solution:
+    def rightSideView(self, root: Optional[TreeNode]) -> List[int]:
+        """
+        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.
+        """
+        if root is None:
+            return []
+
+        parents = [root]
+        result = []
+        while parents:
+            # Get right side of cur level
+            result.append(parents[0].val)
+
+            # Build childs
+            childs = []
+            for p in parents:
+                if p.right:
+                    childs.append(p.right)
+                if p.left:
+                    childs.append(p.left)
+            parents = childs
+        return result

tests/test_199_binary_tree_right_side_view.py

@@ -0,0 +1,21 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._199_binary_tree_right_side_view import Solution
+from awesome_python_leetcode.tree import TreeNode
+
+
+@pytest.mark.parametrize(
+    argnames=["root", "expected"],
+    argvalues=[
+        ([1, 2, 3, None, 5, None, 4], [1, 3, 4]),
+        ([1, 2, 3, 4, None, None, None, 5], [1, 3, 4, 5]),
+        ([1, None, 3], [1, 3]),
+        ([], []),
+    ],
+)
+def test_func(root: List[int], expected: List[int]):
+    root = TreeNode.build(root)
+    right_side_view = Solution().rightSideView(root)
+    assert right_side_view == expected