623-Add One Row to Tree-CSDN博客

本文链接：https://blog.csdn.net/LaputaFallen/article/details/80185842

本文介绍了一种在二叉树的特定深度插入一行新节点的方法。通过递归实现，在指定深度d处添加值为v的新节点，并调整原有节点结构以保持树的连通性。

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

Description

Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.

The adding rule is: given a positive integer depth d, for each NOT null tree nodes N in depth d-1, create two tree nodes with value v as N’s left subtree root and right subtree root. And N’s original left subtree should be the left subtree of the new left subtree root, its original right subtree should be the right subtree of the new right subtree root. If depth d is 1 that means there is no depth d-1 at all, then create a tree node with value v as the new root of the whole original tree, and the original tree is the new root’s left subtree.

Example 1:

Input: 
A binary tree as following:
       4
     /   \
    2     6
   / \   / 
  3   1 5   

v = 1

d = 2

Output: 
       4
      / \
     1   1
    /     \
   2       6
  / \     / 
 3   1   5

Example 2:

Input: 
A binary tree as following:
      4
     /   
    2    
   / \   
  3   1    

v = 1

d = 3

Output: 
      4
     /   
    2
   / \    
  1   1
 /     \  
3       1

Note:

The given d is in range [1, maximum depth of the given tree + 1].
The given binary tree has at least one tree node.

问题描述

给定二叉树的根节点， v和d，你需要在高度为d的一行插入值为v的节点。根节点的高度为1

插入规则为：对于高度为d - 1的每个非空节点N，创建两个节点，分别作为N的左子树的根节点以及右子树的根节点。 N原来的左子树的根节点为新的左子树根节点的左孩子， N原来的右子树的根节点为新的右子树根节点的右孩子。如果d为1，那么新建一个根节点，将原来的根节点作为新建根节点的左孩子。

问题分析

递归的过程中注意传递父节点，然后注意高度，当高度为1时插入新的根节点即可

解法

class Solution {
    public TreeNode addOneRow(TreeNode root, int v, int d) {
        if(d == 1){
            TreeNode row = new TreeNode(v);
            row.left = root;
            return row;
        }

        addOneRow(root, v, d, null);

        return root;
    }

    private void addOneRow(TreeNode root, int v, int d, TreeNode parent) {
        if(d == 1){
            if(parent != null){
                if(parent.left == root){
                    parent.left = new TreeNode(v);
                    parent.left.left = root;
                }else{
                    parent.right = new TreeNode(v);
                    parent.right.right = root;
                }
            }
            return;
        }
        if(root == null)    return;

        addOneRow(root.left, v, d - 1, root);
        addOneRow(root.right, v, d - 1, root);
    }
}