Commit 39b930d

committed

[WIP] 450. Delete Node in a BST

1 parent 4dd8655 commit 39b930dCopy full SHA for 39b930d

File tree

+45

-0

lines changed

leetcode-scala/src/main/scala/LeetCode75/BinarySearchTree
- 450. Delete Node in a BST.sc

+45

-0

lines changed

Lines changed: 45 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,45 @@`
	`1`	`+import scala.annotation.tailrec`
	`2`	`+`
	`3`	`+class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) {`
	`4`	`+ var value: Int = _value`
	`5`	`+ var left: TreeNode = _left`
	`6`	`+ var right: TreeNode = _right`
	`7`	`+}`
	`8`	`+`
	`9`	`+object Solution {`
	`10`	`+ import scala.collection.mutable`
	`11`	`+ def print(root: TreeNode): Unit = {`
	`12`	`+ val array = mutable.ArrayBuffer.empty[mutable.ArrayBuffer[Int]]`
	`13`	`+ def bfs(node: TreeNode, level: Int): Unit = {`
	`14`	`+ if (node != null) {`
	`15`	`+ if (array.size <= level) {`
	`16`	`+ array.addOne(mutable.ArrayBuffer.empty)`
	`17`	`+ }`
	`18`	`+ array(level).addOne(node.value)`
	`19`	`+ bfs(node.left, level + 1)`
	`20`	`+ bfs(node.right, level + 1)`
	`21`	`+ }`
	`22`	`+ }`
	`23`	`+ bfs(root, 0)`
	`24`	`+ array.foreach(println)`
	`25`	`+ }`
	`26`	`+`
	`27`	`+`
	`28`	`+ def deleteNode(root: TreeNode, key: Int): TreeNode = {`
	`29`	`+`
	`30`	`+ }`
	`31`	`+}`
	`32`	`+`
	`33`	`+val tree1 = new TreeNode(5,`
	`34`	`+ _left = new TreeNode(3,`
	`35`	`+ _left = new TreeNode(2),`
	`36`	`+ _right = new TreeNode(4),`
	`37`	`+ ),`
	`38`	`+ _right = new TreeNode(6,`
	`39`	`+ _right = new TreeNode(7)`
	`40`	`+ ),`
	`41`	`+)`
	`42`	`+`
	`43`	`+Solution.print(tree1)`
	`44`	`+val subTree = Solution.deleteNode(tree1, 3)`
	`45`	`+Solution.print(subTree)`

Comments

(0)