@@ -0,0 +1,803 @@
+%22%22%22Leetcode 199. Binary Tree Right Side View%0AMedium%0A%0AURL: https://leetcode.com/problems/binary-tree-right-side-view/%0A%0AGiven a binary tree, imagine yourself standing on the right side of it,%0Areturn the values of the nodes you can see ordered from top to bottom.%0A%0AExample:%0AInput: %5B1,2,3,null,5,null,4%5D%0AOutput: %5B1, 3, 4%5D%0AExplanation:%0A   1            %3C---%0A /   %5C%0A2     3         %3C---%0A %5C     %5C%0A  5     4       %3C---%0A%22%22%22%0A%0A# Definition for a binary tree node.%0Aclass TreeNode(object):%0A    def __init__(self, val):%0A        self.val = val%0A        self.left = None%0A        self.right = None%0A%0A%0Aclass Solution(object):%0A    def rightSideView(self, root):%0A        %22%22%22%0A        :type root: TreeNode%0A        :rtype: List%5Bint%5D%0A        %22%22%22%0A        pass%0A        %0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0199_binary_tree_right_side_view.py