public/subjects/btreeapplyinorder.en.md

btreeapplyinorder

Instructions

Write a function that applies a function in order to each element in the tree (see "in order tree walks").

Expected function

func BTreeApplyInorder(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.BTreeApplyInorder(root, fmt.Println)

}

And its output :

student@ubuntu:~/[[ROOT]]/test$ go build
student@ubuntu:~/[[ROOT]]/test$ ./test
1
4
5
7
student@ubuntu:~/[[ROOT]]/test$