a.zhanguttin
/
public
forked from root/public
1
0
Fork 0
Code Issues 1 Pull Requests Projects Releases Wiki Activity
Browse Source

fix the readme btreeapplypreorder from quest 12

content-update
lee 5 years ago
parent
944af3eb32
commit
d8a7cb35bd
2 changed files with 14 additions and 14 deletions
Whitespace
Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL
Unified View
Diff Options
Show Stats Download Patch File Download Diff File
  1. 14
      subjects/btreeapplypreorder.en.md
  2. 14
      subjects/btreeapplypreorder.fr.md

14
subjects/btreeapplypreorder.en.md
unescape_control_characters View File

@ -7,7 +7,7 @@ Write a function that applies a function using a preorder walk to each element i
### Expected function ### Expected function
```go ```go
func BTreeApplyPreorder(root *piscine.TreeNode, f func(...interface{}) (int, error)) { func BTreeApplyPreorder(root *TreeNode, f func(...interface{}) (int, error)) {
} }
``` ```
@ -20,8 +20,8 @@ Here is a possible [program](TODO-LINK) to test your function :
package main package main
import ( import (
"fmt" "fmt"
piscine "." piscine ".."
) )
func main() { func main() {
@ -29,7 +29,7 @@ func main() {
piscine.BTreeInsertData(root, "1") piscine.BTreeInsertData(root, "1")
piscine.BTreeInsertData(root, "7") piscine.BTreeInsertData(root, "7")
piscine.BTreeInsertData(root, "5") piscine.BTreeInsertData(root, "5")
BTreeApplyPreorder(root, fmt.Println) piscine.BTreeApplyPreorder(root, fmt.Println)
} }
``` ```
@ -37,11 +37,11 @@ func main() {
And its output : And its output :
```console ```console
student@ubuntu:~/piscine/btreeinsertdata$ go build student@ubuntu:~/piscine/test$ go build
student@ubuntu:~/piscine/btreeinsertdata$ ./btreeinsertdata student@ubuntu:~/piscine/test$ ./test
4 4
1 1
7 7
5 5
student@ubuntu:~/piscine/btreeinsertdata$ student@ubuntu:~/piscine/test$
``` ```

14
subjects/btreeapplypreorder.fr.md
unescape_control_characters View File

@ -7,7 +7,7 @@ Write a function that applies a function using a preorder walk to each element i
### Expected function ### Expected function
```go ```go
func BTreeApplyPreorder(root *piscine.TreeNode, f func(...interface{}) (int, error)) { func BTreeApplyPreorder(root *TreeNode, f func(...interface{}) (int, error)) {
} }
``` ```
@ -20,8 +20,8 @@ Here is a possible [program](TODO-LINK) to test your function :
package main package main
import ( import (
"fmt" "fmt"
piscine "." piscine ".."
) )
func main() { func main() {
@ -29,7 +29,7 @@ func main() {
piscine.BTreeInsertData(root, "1") piscine.BTreeInsertData(root, "1")
piscine.BTreeInsertData(root, "7") piscine.BTreeInsertData(root, "7")
piscine.BTreeInsertData(root, "5") piscine.BTreeInsertData(root, "5")
BTreeApplyPreorder(root, fmt.Println) piscine.BTreeApplyPreorder(root, fmt.Println)
} }
``` ```
@ -37,11 +37,11 @@ func main() {
And its output : And its output :
```console ```console
student@ubuntu:~/piscine/btreeinsertdata$ go build student@ubuntu:~/piscine/test$ go build
student@ubuntu:~/piscine/btreeinsertdata$ ./btreeinsertdata student@ubuntu:~/piscine/test$ ./test
4 4
1 1
7 7
5 5
student@ubuntu:~/piscine/btreeinsertdata$ student@ubuntu:~/piscine/test$
``` ```

Write Preview
Loading…
Cancel
Save