题目：
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.
刷题打卡中。
。。。
Same Tree 与昨天所做的Maximum depth 的思路一致，採用函数递归调用的方法。两个二叉树全然同样的条件即是：根节点值同样 and 左子树同样 and 右子树同样
上代码咯
# 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 or q==None:
if p==None and q==None:
return True
else:
return False
else:
if p.val==q.val and self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right):
return True
else:
return False
补充更新~~~
c++里的true和false为小写。而python里为大写