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.

47 lines
632 B

## btreeapplypreorder
6 years ago
### Instructions
Write a function that applies a function using a preorder walk to each element in the tree.
6 years ago
### Expected function
```go
func BTreeApplyPreorder(root *TreeNode, f func(...interface{}) (int, error)) {
}
```
6 years ago
### 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")
piscine.BTreeApplyPreorder(root, fmt.Println)
}
```
And its output :
```console
$ go run .
4
1
7
5
$
```