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.
48 lines
746 B
48 lines
746 B
5 years ago
|
## btreeapplyinorder
|
||
5 years ago
|
|
||
5 years ago
|
### Instructions
|
||
5 years ago
|
|
||
![]()
5 years ago
|
Write a function that applies a function in order to each element in the tree (see "in order tree walks").
|
||
5 years ago
|
|
||
5 years ago
|
### Expected function
|
||
5 years ago
|
|
||
|
```go
|
||
5 years ago
|
func BTreeApplyInorder(root *TreeNode, f func(...interface{}) (int, error)) {
|
||
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"
|
||
|
piscine ".."
|
||
5 years ago
|
)
|
||
|
|
||
|
func main() {
|
||
|
root := &piscine.TreeNode{Data: "4"}
|
||
|
piscine.BTreeInsertData(root, "1")
|
||
|
piscine.BTreeInsertData(root, "7")
|
||
|
piscine.BTreeInsertData(root, "5")
|
||
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
|
1
|
||
|
4
|
||
|
5
|
||
|
7
|
||
5 years ago
|
student@ubuntu:~/[[ROOT]]/test$
|
||
5 years ago
|
```
|