working solution

problem1.py

@@ -0,0 +1,22 @@
+# problem 1 
+
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def rightSideView(self, root: Optional[TreeNode]) -> List[int]:
+        self.final_arr = []
+        self.helper(root,0)
+        return self.final_arr 
+
+    def helper(self,root,depth):
+        if not root:
+            return 
+        if len(self.final_arr) == depth:
+            self.final_arr.append(float('-inf')) # 
+        self.helper(root.left,depth+1)
+        self.final_arr[depth] = root.val
+        self.helper(root.right,depth+1)

problem2.py

@@ -0,0 +1,35 @@
+# problem 2 
+
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+
+    def helper(self,root,x,y,depth,parent):
+        if not root:
+            return 
+        if x == root.val:
+            self.x_depth = depth 
+            self.x_parent = parent
+
+        if y == root.val:
+            self.y_depth = depth
+            self.y_parent = parent
+
+        self.helper(root.left,x,y,depth+1,root)
+        self.helper(root.right,x,y,depth+1,root)
+
+    def isCousins(self, root: Optional[TreeNode], x: int, y: int) -> bool:
+        self.x_parent = None
+        self.y_parent = None 
+        self.x_depth = -1 
+        self.y_depth = -1 
+
+        self.helper(root,x,y,0,None)
+
+        if self.x_parent != self.y_parent and self.x_depth == self.y_depth:
+            return True 
+        return False