Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions src/my_project/interviews/top_150_questions_round_11/same_tree.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
from typing import List, Union, Collection, Mapping, Optional
from abc import ABC, abstractmethod

class TreeNode:
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right

class Solution:
def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:

if p and q:
return p.val == q.val \
and self.isSameTree(p.left, q.left) \
and self.isSameTree(p.right, q.right)
else:
return p is q
19 changes: 19 additions & 0 deletions tests/test_150_questions_round_11/test_same_tree_round_11.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
import unittest
from src.my_project.interviews.top_150_questions_round_11\
.same_tree import TreeNode, Solution

class SameTreeTestCase(unittest.TestCase):

def test_is_same_tree(self):
solution = Solution()
tree1 = TreeNode(1, TreeNode(2), TreeNode(3))
tree2 = TreeNode(1, TreeNode(2), TreeNode(3))
output = solution.isSameTree(p=tree1, q=tree2)
return self.assertTrue(output)

def test_is_no_same_tree(self):
solution = Solution()
tree1 = TreeNode(1, TreeNode(2), TreeNode(3))
tree2 = TreeNode(1, TreeNode(3), TreeNode(2))
output = solution.isSameTree(p=tree1, q=tree2)
return self.assertFalse(output)
Loading