codebuddy week8

IdenticalBinaryTrees.py

# Definition for a  binary tree node
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    # @param A : root node of tree
    # @param B : root node of tree
    # @return an integer
    
    def check(self,A,B):
        if A==None and B==None:
            return 1
        if A==None and B!=None:
            return 0
        if A!=None and B==None:
            return 0
        if A.val==B.val:
            l=self.check(A.left,B.left)
            r=self.check(A.right,B.right)
            return l and r
        else:
            return 0
    
    def isSameTree(self, A, B):
        return self.check(A,B)