623. 在二叉树中增加一行

623. 在二叉树中增加一行

题目描述

解题思路

1、层次遍历
2、记录depth上一层所有节点信息

代码实现

# 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 = right
class Solution:
    def addOneRow(self, root: TreeNode, val: int, depth: int) -> TreeNode:
        # 层次遍历
        if not root:
            return 

        if depth == 1:
            head = TreeNode(val)
            head.left = root
            return head

        queue = [root]
        curdepth = 1
        while queue:
            size = len(queue)
            # if curdepth == depth - 1:
            for _ in range(size):
                node = queue.pop(0)
                if node.left:
                    if curdepth == depth - 1:
                        new_node = TreeNode(val)
                        new_node.left = node.left
                        node.left = new_node
                    else:
                        queue.append(node.left)

                if node.right:
                    if curdepth == depth - 1:
                        new_node = TreeNode(val)
                        new_node.right = node.right
                        node.right = new_node
                    else:
                        queue.append(node.right)
            if curdepth == depth - 1:
                return root
            curdepth += 1

参考文献

1、官方题解