forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
0450-delete-node-in-a-bst.kt
36 lines (30 loc) · 931 Bytes
/
0450-delete-node-in-a-bst.kt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/**
* Example:
* var ti = TreeNode(5)
* var v = ti.`val`
* Definition for a binary tree node.
* class TreeNode(var `val`: Int) {
* var left: TreeNode? = null
* var right: TreeNode? = null
* }
*/
//recursive solution
class Solution {
fun deleteNode(root: TreeNode?, key: Int): TreeNode? {
root?: return null
if (root.value < key) {
root.right = deleteNode(root.right, key)
} else if (root.value > key) {
root.left = deleteNode(root.left, key)
} else {
if (root.right == null) return root.left
if (root.left == null) return root.right
var current = root.right
while (current.left != null) current = current.left
root.`val` = current.value
root.right = deleteNode(root.right, root.value)
}
return root
}
private val TreeNode.value get() = `val`
}