101、对称二叉树
给你一个二叉树的根节点 root
, 检查它是否轴对称。
示例1:
输入:root = [1,2,2,3,4,4,3]
输出:true
示例2:
输入:root = [1,2,2,null,3,null,3]
输出:false
思路:
可以使用层序遍历,看每一层的数据是否是对称的
class Solution:
def isSymmetric(self, root: TreeNode) -> bool:
if not root: return True
queue = [root]
while queue:
# 遍历每一层的值,空节点的话用None值替代
cur = [node.val if node else None for node in queue]
if cur != cur[::-1]: return False
# 遍历每一层的结点,这里如果子节点如果为空,也放在队列中
queue = [n for node in queue if node for n in [node.left, node.right]]
return True
上面使用数组的逆序进行判断,其实也可以头尾进行判断
class Solution:
# 判断结点列表是否对称
def check(self, nodes: List[TreeNode]) -> bool:
n = len(nodes)
for i in range(n // 2):
left, right = nodes[i], nodes[n-i-1]
if not left and not right: continue
if not left or not right: return False
if left.val != right.val: return False
return True
def isSymmetric(self, root: TreeNode) -> bool:
if not root: return True
queue = [root]
while queue:
cur = [node for node in queue]
if not self.check(cur): return False
# 如果队列中的元素都是None,提前退出
if not any(queue): break
queue = [n for node in queue if node for n in [node.left, node.right]]
return True
将左右子树看成两颗树,然后同步取左树的左子节点和右树的右子结点,左树的右子结点和右树的左子节点进行比较
class Solution:
def check(self, p: TreeNode, q:TreeNode) -> bool:
# 如果同时没有或者值相同且子树也对称,则返回True
if not p and not q: return True
if not p or not q: return False
return p.val == q.val and self.check(p.left, q.right) and self.check(p.right, q.left)
def isSymmetric(self, root: TreeNode) -> bool:
if not root: return True
return self.check(root.left, root.right)
226、翻转二叉树
给你一棵二叉树的根节点 root
,翻转这棵二叉树,并返回其根节点。
示例1:
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
示例2:
输入:root = [2,1,3]
输出:[2,3,1]
示例3:
输入:root = []
输出:[]
思路:
可以使用层序遍历,将每个节点的左子节点和右子结点进行对调即可
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if not root: return root
queue = [root]
while queue:
# 遍历queue,将子节点进行对调
for node in queue:
node.left, node.right = node.right, node.left
# 如果队列都为None,提前退出
if not any(queue): break
queue = [n for node in queue for n in [node.left, node.right] if n]
return root
也可使用递归来对每个子节点进行对调
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if not root: return None
# 递归得到左右子节点,然后进行对调
left = self.invertTree(root.left)
right = self.invertTree(root.right)
root.left, root.right = right, left
return root