algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 08:50:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #96 from Joshua-Lu/patch-12

Browse Source 
添加 0538.把二叉搜索树转换为累加树 Java版本
This commit is contained in:
Carl Sun
2021-05-14 10:13:31 +08:00
committed by GitHub
parent 9a82c1751a 9535f37731
commit f9931439a1
1 changed files with 13 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
problems/0538.把二叉搜索树转换为累加树.md
View File

@ -173,20 +173,24 @@ public:
Java： Java：
```java ```Java
class Solution { class Solution {
private int count = 0; int sum;
public TreeNode convertBST(TreeNode root) { public TreeNode convertBST(TreeNode root) {
convert(root); sum = 0;
convertBST1(root);
return root; return root;
} }
private void convert (TreeNode root) { // 按右中左顺序遍历，累加即可
if (root == null) return; public void convertBST1(TreeNode root) {
convert(root.right); if (root == null) {
count += root.val; return;
root.val = count; }
convert(root.left); convertBST1(root.right);
sum += root.val;
root.val = sum;
convertBST1(root.left);
} }
} }
``` ```