代码随想录Day15-二叉树

学习目标：

二叉树十题
中心思想:二叉树的层序遍历

学习内容：

最重要！！
二叉树的层序遍历中心思想

"""
# Definition for a Node.
class Node:
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

class Solution:
    def levelOrder(self, root: 'Node') -> List[List[int]]:
        results =[]
        if root is None:
            return results
        
        from collections import deque
        que = deque([root])
        while que:
            size = len(que)
            result =[]
            for _ in range(size):
                cur = que.popleft()
                result.append(cur.val)
                if cur.left:
                    que.append(cur.left)
                if cur.right:
                    que.append(cur.right)
            results.append(result)
        return results

N 叉树

“”"

# Definition for a Node.
class Node:
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

class Solution:
    def levelOrder(self, root: 'Node') -> List[List[int]]:
        results =[]
        if root is None:
            return results
        
        from collections import deque
        que = deque([root])
        while que:
            size = len(que)
            result =[]
            for _ in range(size):
                cur = que.popleft()
                result.append(cur.val)

                for child in cur.children:
                    que.append(child)

            results.append(result)
        return results

填充每一个节点的右侧节点指针

"""
# Definition for a Node.
class Node:
    def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None):
        self.val = val
        self.left = left
        self.right = right
        self.next = next
"""

class Solution:
    def connect(self, root: 'Optional[Node]') -> 'Optional[Node]':
        if root is None:
            return root
        
        from collections import deque
        que = deque([root])
        while que:
            size = len(que)
            prev = None
            for _ in range(size):
                cur = que.popleft()
				# 如果右侧有值，则prev 为下一个值
				#如果没有 则为#
                if prev:
                    prev.next = cur
                prev = cur

                if cur.left:
                    que.append(cur.left)
                if cur.right:
                    que.append(cur.right)
        

        return root
    

翻转二叉树

class Solution:
    def invertTree(self, root: TreeNode) -> TreeNode:
        if not root:
            return None
        root.left, root.right = root.right, root.left
        self.invertTree(root.left)
        self.invertTree(root.right)
        return root
        

对称二叉树

class Solution:
    def isSymmetric(self, root: TreeNode) -> bool:
        if not root:
            return True
        return self.compare(root.left, root.right)
        
    def compare(self, left, right):
        #首先排除空节点的情况
        if left == None and right != None: return False
        elif left != None and right == None: return False
        elif left == None and right == None: return True
        #排除了空节点，再排除数值不相同的情况
        elif left.val != right.val: return False
        
        #此时就是：左右节点都不为空，且数值相同的情况
        #此时才做递归，做下一层的判断
        outside = self.compare(left.left, right.right) #左子树：左、 右子树：右
        inside = self.compare(left.right, right.left) #左子树：右、 右子树：左
        isSame = outside and inside #左子树：中、 右子树：中 （逻辑处理）
        return isSame

学习时间：

12.18

学习产出：

1. 学习了二叉树的层次遍历10题
2. 两道不一样思想的题迭代