Commitca2c275

authored

Update 0450-delete-node-in-a-bst.java

The earlier code provided wasn't working for all cases. I have edited the code.

1 parent40e983b commitca2c275Copy full SHA for ca2c275

File tree

+14

-22

lines changed

+14

-22

lines changed

Lines changed: 14 additions & 22 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,32 +1,24 @@`
`1`		`-/**`
`2`		`- * TC : log (n)`
`3`		`- *`
`4`		`- * */`
`5`	`1`	`classSolution {`
`6`		`-publicTreeNodeminimumVal(TreeNoderoot) {`
`7`		`-TreeNodecurr =root;`
`8`		`-while (curr !=null &&curr.left !=null) {`
`9`		`-curr =curr.left;`
	`2`	`+publicTreeNodefindMin(TreeNodenode) {`
	`3`	`+TreeNodecurrent =node;`
	`4`	`+while (current.left !=null) {`
	`5`	`+current =current.left;`
`10`	`6`	`}`
`11`		`-returncurr;`
	`7`	`+returncurrent;`
`12`	`8`	`}`
`13`	`9`
`14`	`10`	`publicTreeNodedeleteNode(TreeNoderoot,intkey) {`
`15`	`11`	`if (root ==null)returnnull;`
`16`	`12`
`17`		`-if (key >root.val) {`
`18`		`-root.right =deleteNode(root.right,key);`
`19`		`- }elseif (key <root.val) {`
`20`		`-root.left =deleteNode(root.left,key);`
`21`		`- }else {`
`22`		`-if (root.left ==null) {`
`23`		`-returnroot.right;`
`24`		`- }elseif (root.right ==null) {`
`25`		`-returnroot.left;`
`26`		`- }else {`
`27`		`-TreeNodeminVal =minimumVal(root);`
`28`		`-root.val =minVal.val;`
`29`		`-root.right =deleteNode(root.right,minVal.val);`
	`13`	`+if (root.val >key)root.left =deleteNode(root.left,key);`
	`14`	`+elseif (root.val <key)root.right =deleteNode(root.right,key);`
	`15`	`+else {`
	`16`	`+if (root.left ==null)returnroot.right;`
	`17`	`+elseif (root.right ==null)returnroot.left;`
	`18`	`+else {`
	`19`	`+TreeNodesuccessor =findMin(root.right);`
	`20`	`+root.val =successor.val;`
	`21`	`+root.right =deleteNode(root.right,successor.val);`
`30`	`22`	`}`
`31`	`23`	`}`
`32`	`24`	`returnroot;`

Comments

(0)