题目:
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(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 p == None and q == None :
return True
else :
if p != None and q != None:
if p.val == q.val :
return True and self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
else :
return False
else :
return False
笔记:
1、if 循环、for 条件判断的时候,后面的冒号 : 一定要与前面的字符隔开,不然编译错误
2、逻辑操作: