Package g0601_0700.s0623_add_one_row_to_tree

Class Solution

java.lang.Object

g0601_0700.s0623_add_one_row_to_tree.Solution

public class Solution
extends Object

623 - Add One Row to Tree.<p>Medium</p> <p>Given the <code>root</code> of a binary tree and two integers <code>val</code> and <code>depth</code>, add a row of nodes with value <code>val</code> at the given depth <code>depth</code>.</p> <p>Note that the <code>root</code> node is at depth <code>1</code>.</p> <p>The adding rule is:</p> <ul> <li>Given the integer <code>depth</code>, for each not null tree node <code>cur</code> at the depth <code>depth - 1</code>, create two tree nodes with value <code>val</code> as <code>cur</code>&rsquo;s left subtree root and right subtree root.</li> <li><code>cur</code>&rsquo;s original left subtree should be the left subtree of the new left subtree root.</li> <li><code>cur</code>&rsquo;s original right subtree should be the right subtree of the new right subtree root.</li> <li>If <code>depth == 1</code> that means there is no depth <code>depth - 1</code> at all, then create a tree node with value <code>val</code> as the new root of the whole original tree, and the original tree is the new root&rsquo;s left subtree.</li> </ul> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/03/15/addrow-tree.jpg" alt="" /></p> <p><strong>Input:</strong> root = [4,2,6,3,1,5], val = 1, depth = 2</p> <p><strong>Output:</strong> [4,1,1,2,null,null,6,3,1,5]</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/03/11/add2-tree.jpg" alt="" /></p> <p><strong>Input:</strong> root = [4,2,null,3,1], val = 1, depth = 3</p> <p><strong>Output:</strong> [4,2,null,1,1,3,null,null,1]</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in the tree is in the range <code>[1, 10⁴]</code>.</li> <li>The depth of the tree is in the range <code>[1, 10⁴]</code>.</li> <li><code>-100 <= Node.val <= 100</code></li> <li><code>-10⁵ <= val <= 10⁵</code></li> <li><code>1 <= depth <= the depth of tree + 1</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
TreeNode	addOneRow(TreeNode root, int val, int depth)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

addOneRow

public TreeNode addOneRow(TreeNode root,
 int val,
 int depth)