【leetcode】100：相同的树

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:
        if p==None and q==None:
            return True
        if p==None and q!=None or p!=None and q==None:
            return False
        
        bool_one=self.isSameTree(p.left,q.left)
        bool_two=self.isSameTree(p.right,q.right)
        if p.val==q.val:
            bool_three=True
        else:
            bool_three=False

        return bool_one and bool_two and bool_three