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.
636 B
636 B
btreeapplypostorder
Instructions
Write a function that applies a function using a postorder walk to each element in the tree.
Expected function
func BTreeApplyPostorder(root *TreeNode, f func(...interface{}) (int, error)) {
}
Usage
Here is a possible program to test your function :
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 :
$ go run .
1
5
7
4
$