problems: trees

100_Same Tree/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
+        if p == None and q == None:
+            return True
+        elif p == None or q == None:
+            return False
+        if(q.val == p.val):
+            return self.isSameTree(p.right, q.right) and self.isSameTree(p.left, q.left)

104_Maximum Depth Binary Tree/Solution.py

@@ -0,0 +1,14 @@
+class Solution:
+    def maxDepth(self, root: Optional[TreeNode]) -> int:
+        if root == None:
+            return 0
+        elif root.right == None and root.left == None:
+            return 1
+        else:
+            leftHeight = 0
+            rightHeight = 0
+            if root.right != None:
+                rightHeight = self.maxDepth(root.right)
+            if root.left != None:
+                leftHeight = self.maxDepth(root.left)
+            return max(leftHeight, rightHeight) + 1