https://leetcode.com/problems/same-tree/description/


# 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: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
        if p == None and q == None : return True
        if p == None or q == None : return False
        return p.val == q.val and self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right)


아 야근하고 졸려서 그런가 Easy인데 어제보다 어려운거 같네

한 줄 풀이는 너무 ugly 해서 걍 올림