GeezerVison is showing github.com — tech-code-interview/same_tree.py at master · BarthJr/tech-code-interview

Expand file tree

same_tree.py

Copy path

More file actions

Latest commit

History

53 lines (47 loc) · 1.04 KB

same_tree.py

Copy path

File metadata and controls

53 lines (47 loc) · 1.04 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

# https://leetcode.com/problems/same-tree/

# Given two binary trees, write a function to check if they are the same or not.

# Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

# Example 1:

# Input: 1 1

# / \ / \

# 2 3 2 3

# [1,2,3], [1,2,3]

# Output: true

# Example 2:

# Input: 1 1

# / \

# 2 2

# [1,2], [1,null,2]

# Output: false

# Example 3:

# Input: 1 1

# / \ / \

# 2 1 1 2

# [1,2,1], [1,1,2]

# Output: false

class TreeNode:

def __init__(self, x):

self.val = x

self.left = None

self.right = None

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

if not p and not q:

return True

elif not p or not q:

return False

elif p.val != q.val:

return False

else:

return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)