Commit3d0f493

authored

Merge pull requestneetcode-gh#3267 from a1exanddrovich/0538-dev

Create: 0538-convert-bst-to-greater-tree.java

2 parentse6de3e3 +c897069 commit3d0f493Copy full SHA for 3d0f493

File tree

+43

-0

lines changed

+43

-0

lines changed

Lines changed: 43 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,43 @@`
	`1`	`+// Recursive solution`
	`2`	`+classSolution {`
	`3`	`+privateintcurSum =0;`
	`4`	`+`
	`5`	`+publicTreeNodeconvertBST(TreeNoderoot) {`
	`6`	`+convertBSTRecursive(root);`
	`7`	`+returnroot;`
	`8`	`+ }`
	`9`	`+`
	`10`	`+privatevoidconvertBSTRecursive(TreeNodenode) {`
	`11`	`+if (node ==null) {`
	`12`	`+return;`
	`13`	`+ }`
	`14`	`+`
	`15`	`+convertBSTRecursive(node.right);`
	`16`	`+inttemp =node.val;`
	`17`	`+node.val +=curSum;`
	`18`	`+curSum +=temp;`
	`19`	`+convertBSTRecursive(node.left);`
	`20`	`+ }`
	`21`	`+}`
	`22`	`+`
	`23`	`+// Iterative solution`
	`24`	`+classSolution {`
	`25`	`+publicTreeNodeconvertBST(TreeNoderoot) {`
	`26`	`+Stack<TreeNode>stack =newStack<>();`
	`27`	`+TreeNodecur =root;`
	`28`	`+`
	`29`	`+intcurSum =0;`
	`30`	`+while (cur !=null \|\| !stack.isEmpty()) {`
	`31`	`+while (cur !=null) {`
	`32`	`+stack.push(cur);`
	`33`	`+cur =cur.right;`
	`34`	`+ }`
	`35`	`+cur =stack.pop();`
	`36`	`+cur.val +=curSum;`
	`37`	`+curSum =cur.val;`
	`38`	`+cur =cur.left;`
	`39`	`+ }`
	`40`	`+`
	`41`	`+returnroot;`
	`42`	`+ }`
	`43`	`+}`

Comments

(0)