100.same tree
題目給定兩個tree
判斷他們是不是長一樣
判斷節點一樣加遞迴左右子樹
class Solution:
def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
if p is not None and q is not None:
return p.val == q.val and self.isSameTree(p.left, q.left) and self.i
sSameTree(p.right, q.right)
elif p is None and q is None:
return True
else:
return False