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.
50 lines
961 B
50 lines
961 B
5 years ago
|
## btreetransplant
|
||
5 years ago
|
|
||
5 years ago
|
### Instructions
|
||
![]()
5 years ago
|
|
||
![]()
5 years ago
|
In order to move subtrees around within the binary search tree, write a function, `BTreeTransplant`, which replaces the subtree started by `node` with the node `rplc` in the tree given by `root`.
|
||
![]()
5 years ago
|
|
||
5 years ago
|
### Expected function
|
||
![]()
5 years ago
|
|
||
|
```go
|
||
|
func BTreeTransplant(root, node, rplc *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, "1")
|
||
|
replacement := &piscine.TreeNode{Data: "3"}
|
||
|
root = piscine.BTreeTransplant(root, node, replacement)
|
||
|
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
|
3
|
||
|
4
|
||
|
5
|
||
|
7
|
||
5 years ago
|
student@ubuntu:~/[[ROOT]]/test$
|
||
![]()
5 years ago
|
```
|