FilesExpand file tree

 master

/

same-tree.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

26 lines (24 loc) · 765 Bytes

 master

/

same-tree.py

Copy path

Top

File metadata and controls

• Code
• Blame

26 lines (24 loc) · 765 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

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

#

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

#

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

# Definition for a binary tree node

# class TreeNode:

# def __init__(self, x):

# self.val = x

# self.left = None

# self.right = None

class Solution:

# @param p, a tree node

# @param q, a tree node

# @return a boolean

def isSameTree(self, p, q):

if p==None and q == None :

return True

elif p== None or q ==None:

return False

elif p.val == q.val:

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

else:

return False