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