Leetcode刻意练习----二叉树2
题目
给定一个二叉树,检查它是否是镜像对称的。
例如,二叉树 [1,2,2,3,4,4,3] 是对称的。
1
/ \
2 2
/ \ / \
3 4 4 3
但是下面这个 [1,2,2,null,3,null,3] 则不是镜像对称的:
1
/ \
2 2
\ \
3 3
说明:
如果你可以运用递归和迭代两种方法解决这个问题,会很加分。
思路
根据上一个相同二叉树方法,将比较两个二叉树改为比较一个二叉树的左子树和右子树,即左子树的左支与右子树的右支相等,在运用迭代和递归的方法进行重复比较。
题解一(递归)
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:
if p == None and q == None:
return True
elif p == None or q == None:
return False
elif p.val != q.val:
return False
return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
题解二(迭代)
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
from collections import deque
class Solution:
def isSymmetric(self, root: TreeNode) -> bool:
if root == None:
return True
deq = deque([root.left, root.right])
while deq:
root_right = deq.pop()
root_left = deq.pop()
if root_left == None and root_right == None:
continue
elif root_left == None or root_right == None:
return False
elif root_left.val != root_right.val:
return False
deq.append(root_left.left)
deq.append(root_right.right)
deq.append(root_left.right)
deq.append(root_right.left)
return True
通过这个代码,学习了一些关于deque库的相关知识,详情见https://jingyan.baidu.com/article/75ab0bcba51d1ed6864db22e.html
还有就是要注意deque使用之前要通过from collections import deque将此模块引入