# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def isSameTree(self, p, q):
"""
:type p: TreeNode
:type q: TreeNode
:rtype: bool
if not p and not q:
return True
elif p and q:
if p.val==q.val:
return self.isSameTree(p.left ,q.left)and self.isSameTree(p.right,q.right)
else:
return False
else:
return False
"""
queue=[[p,q]]
while queue:
pairs=queue.pop(0)
a=pairs[0]
b=pairs[1]
if not a and not b:
continue
elif a and b:
if a.val==b.val:
queue.append([a.left,b.left])
queue.append([a.right,b.right])
else:
return False
else:
return False
return True
第一种方法：递归
第二种方法：放到一个list里
