root
/
public
mirror of https://github.com/01-edu/public.git
14
27
Fork 3
Code Releases Wiki Activity
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.
2582 Commits
76 Branches
1 Tag
311 MiB
 
 
 
 
 
 
Tree: e160f65471
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'e160f65471'
${ noResults }
public/subjects/btreeapplypreorder
xpetit e160f65471
Remove relative imports (no longer works with modules) and remove invalid character (" ") 		3 years ago
..
README.md Remove relative imports (no longer works with modules) and remove invalid character (" ") 3 years ago

README.md

btreeapplypreorder

Instructions

Write a function that applies a function using a preorder walk to each element in the tree.

Expected function

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

}

And its output :

$ go run .
4
1
7
5
$