623. Add One Row to Tree(Difficulty: Medium)
来源:互联网 发布:java web经典面试题 编辑:程序博客网 时间:2024/05/29 09:30
题目:
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
asN'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, itsoriginal 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.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* addOneRow(TreeNode* root, int v, int d) {
if(d==1)
{
TreeNode * newtree = new TreeNode(v);
newtree->left = root;
return newtree;
}
else if (d == 2) {
TreeNode * newtreeleft = new TreeNode(v);
TreeNode * newtreeright = new TreeNode(v);
newtreeleft->left = root->left;
root->left = newtreeleft;
newtreeright->right = root->right;
root->right = newtreeright;
return root;
}
else if (d > 2) {
root->left = addOneRow(root->left, v, d - 1);
root->right = addOneRow(root->right, v, d - 1);
return root;
}
}
};
- 623. Add One Row to Tree(Difficulty: Medium)
- 【LeetCode】623.Add One Row to Tree(Medium)解题报告
- 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
- 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 ? 待解决
- HAProxy知识总结
- MyFlag Step13:打卡功能的初步讨论
- c语言web服务器
- session cookie原理
- 学习Python爬虫
- 623. Add One Row to Tree(Difficulty: Medium)
- Servlet中 请求转发:
- 南阳理工POJ 大数阶乘
- poj 字符串相关之1200 Crazy Search
- mybatis的懒加载
- Android:获取并制作矢量图动画
- 备用
- 关于Android 7.0相机遇到的一些问题
- 过滤非嵌套的html tag, 最近要用,先来写个函数!