You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

59 lines
1001 B

## btreedeletenode
### Instructions
Write a function, `BTreeDeleteNode`, that deletes `node` from the tree given by `root`.
The resulting tree should still follow the binary search tree rules.
### Expected function
```go
func BTreeDeleteNode(root, node *TreeNode) *TreeNode {
}
```
### Usage
Here is a possible program to test your function :
```go
package main
import (
"fmt"
piscine ".."
)
func main() {
root := &piscine.TreeNode{Data: "4"}
piscine.BTreeInsertData(root, "1")
piscine.BTreeInsertData(root, "7")
piscine.BTreeInsertData(root, "5")
node := piscine.BTreeSearchItem(root, "4")
fmt.Println("Before delete:")
piscine.BTreeApplyInorder(root, fmt.Println)
root = piscine.BTreeDeleteNode(root, node)
fmt.Println("After delete:")
piscine.BTreeApplyInorder(root, fmt.Println)
}
```
And its output :
```console
student@ubuntu:~/[[ROOT]]/test$ go build
student@ubuntu:~/[[ROOT]]/test$ ./test
Before delete:
1
4
5
7
After delete:
1
5
7
student@ubuntu:~/[[ROOT]]/test$
```