lintcode_Convert BST to Greater Tree
来源:互联网 发布:铆工放样软件 编辑:程序博客网 时间:2024/04/25 02:36
1.描述:
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
样例
2.思路:Given a binary search Tree `{5,2,3}`:
5 / \ 2 13
Return the root of new tree
18 / \ 20 13
先找到最右节点,从右往左依次更新节点值即可
3.代码:
int rr=0;
TreeNode* convertBST(TreeNode* root) {
if(root==NULL) return NULL;
else {
convertBST(root->right);
root->val+=rr;
rr=root->val;
convertBST(root->left);
}
return root;
}
4.感想:
这个题一开始想复杂了,总想着先去遍历一遍记录所有节点值,结果越走越远
阅读全文
0 0
- lintcode_Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- convert bst to greater tree
- Convert BST to Greater Tree
- Convert BST to Greater Tree
- python检查文本中的冒犯语句
- ifconfig,发现根本就没有eth0。 只有 lo
- 详解栈区、堆区、全局区、文字常量区、程序代码区
- 高并发服务器架构笔记(2)——面向对象编程风格
- web前端开发之二级菜单的隐藏和展开
- lintcode_Convert BST to Greater Tree
- OpenGL初探:二维卡通人物交互设计
- 关于创建Layout-large文件夹
- 实验6
- MySQL数据类型-decimal详解
- markdown编辑图片怎么调整大小
- java-架构(1.8)
- 每日分享 《一生如寄 人来人往》
- win10下 VS2013配置DirectShow+Opencv