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
738 B

## btreeapplypostorder
6 years ago
### Instructions
Write a function that applies a function using a postorder walk to each element in the tree.
6 years ago
### Expected function
```go
func BTreeApplyPostorder(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.BTreeApplyPostorder(root, fmt.Println)
}
```
And its output :
```console
student@ubuntu:~/[[ROOT]]/test$ go build
student@ubuntu:~/[[ROOT]]/test$ ./test
1
5
7
4
student@ubuntu:~/[[ROOT]]/test$
```