623. Add One Row to Tree
来源:互联网 发布:python init 编辑:程序博客网 时间:2024/05/29 09:11
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 = 1d = 2Output: 4 / \ 1 1 / \ 2 6 / \ / 3 1 5
Example 2:
Input: A binary tree as following: 4 / 2 / \ 3 1 v = 1d = 3Output: 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.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public TreeNode addOneRow(TreeNode root, int v, int d) { if (d == 1) {TreeNode newroot = new TreeNode(v);newroot.left = root;return newroot;}Queue<TreeNode> data = new LinkedList<TreeNode>();data.add(root);d -= 1;while (d > 1) {int n = data.size();while (n > 0) {TreeNode temp = data.poll();if (temp.left != null)data.add(temp.left);if (temp.right != null)data.add(temp.right);n -= 1;}d -= 1;}while (!data.isEmpty()) {TreeNode temp = data.poll();TreeNode newleft = new TreeNode(v);TreeNode newright = new TreeNode(v);if (temp.left != null)newleft.left = temp.left;if (temp.right != null)newright.right = temp.right;temp.left = newleft;temp.right = newright;}return root; }}
- leetcode-623. Add One Row to Tree
- leetcode 623. Add One Row to Tree
- Leetcode 623. Add One Row to Tree
- [LeetCode] 623. Add One Row to Tree
- 623. Add One Row to Tree
- 623. Add One Row to Tree
- leetcode 623. Add One Row to Tree
- 623. Add One Row to Tree
- 623. Add One Row to Tree
- 623. Add One Row to Tree
- Add One Row to Tree
- 623. Add One Row to Tree(Difficulty: Medium)
- 【LeetCode】623.Add One Row to Tree(Medium)解题报告
- leetcode 623 Add One Row to Tree
- [LeetCode] Add One Row to Tree
- LeetCode Add One Row to Tree
- Add One Row to Tree问题及解法
- leetcode_623. Add One Row to Tree ? 待解决
- Resteasy配置及其使用
- Android学习日记(yzy):Service的两种启动
- 求逆矩阵的方法
- springboot集成prometheus
- LightOJ 1106 Gone Fishing(贪心)
- 623. Add One Row to Tree
- c++重载与重写
- Newtonsoft.Json输出Json时动态忽略属性
- python下载文件的三种方法
- Android Notification 详解
- Mybatis集成Redis
- redis安装流程
- HDU 1078 FatMouse and Cheese(动态规划)
- IntelliJ IDEA快捷键