小黑国贸喜茶面试跑步，被面试官肯定了数据结构算法能力心里略有开心的leetcode之旅:623. 在二叉树中增加一行-CSDN博客

本文链接：https://blog.csdn.net/qq_37418807/article/details/128397656

小黑分享了他在编程笔试中的经验，包括使用深度优先和层次遍历方法为二叉树添加一行节点的解决方案。他还提到最近的面试，成功解答了中等难度的算法题，获得了面试官的认可，但意识到需要加强计算机基础知识。此外，小黑的生活丰富多彩，从品尝网红麻辣烫到跑步锻炼，再到学习钢琴和接受事业单位笔试通知，展现了他积极的生活态度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

小黑代码

# 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: Optional[TreeNode], val: int, depth: int) -> Optional[TreeNode]:
        self.depth = depth

        def dfs(node, depth):
            if not node:
                return
            # 深度+1
            depth += 1
            if depth == self.depth-1:
                left_node = TreeNode(val=val)
                left_node.left = node.left
                node.left = left_node
                right_node = TreeNode(val=val)
                right_node.right = node.right
                node.right = right_node
                return
            dfs(node.left, depth)
            dfs(node.right, depth)
        if depth==1:
            root_node = TreeNode(val=val)
            root_node.left = root
            root = root_node
        else:
            dfs(root,0)
        return root

在这里插入图片描述

深度优先

# 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: Optional[TreeNode], val: int, depth: int) -> Optional[TreeNode]:
        if not root:
            return
        if depth == 1:
            root = TreeNode(val=val, left=root)
        elif depth == 2:
            root.left = TreeNode(val=val, left=root.left)
            root.right = TreeNode(val=val, right=root.right)
            
        else:
            self.addOneRow(root.left, val, depth-1)
            self.addOneRow(root.right, val, depth-1)
        return root

在这里插入图片描述

层次遍历

# 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: Optional[TreeNode], val: int, depth: int) -> Optional[TreeNode]:
        if not root:
            return None
        # 深度为1的时候
        if depth == 1:
            return TreeNode(val=val, left=root)
        pre_layer = [root]
        # 找到第depth-1层
        for _ in range(1,depth-1):
            cur_layer = []
            for node in pre_layer:
                # 将其左右结点插入
                if node.left:
                    cur_layer.append(node.left)
                if node.right:
                    cur_layer.append(node.right)
            pre_layer = cur_layer
        # 对应depth的父结点操作
        for node in pre_layer:
            node.left = TreeNode(val=val, left=node.left)
            node.right = TreeNode(val=val, right=node.right)
        return root