当前位置：网站首页>LeetCode 100. The same tree (simple)

LeetCode 100. The same tree (simple)

2022-08-10 05:56:00 【Shengxin Research Ape】

python recursion

# 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 = rightclass Solution:def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:if(p==None and q==None):return Trueif(p==None or q==None):return Falseif(p.val !=q.val):return Falsereturn self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right)

原网站

版权声明
本文为[Shengxin Research Ape]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/222/202208100529371324.html

边栏推荐

猜你喜欢

随机推荐