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

readme btreemin from quest 12

content-update
lee 5 years ago
parent
dfae81bbd1
commit
1701eb3228
2 changed files with 22 additions and 20 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. 21
      subjects/btreemin.en.md
  2. 21
      subjects/btreemin.fr.md

21
subjects/btreemin.en.md
unescape_control_characters View File

@ -2,7 +2,7 @@
### Instructions ### Instructions
Write a function, BTreeMin, that returns the node with the minimum value in the tree given by root Write a function, `BTreeMin`, that returns the node with the minimum value in the tree given by root
This function must have the following signature. This function must have the following signature.
@ -23,15 +23,16 @@ package main
import ( import (
"fmt" "fmt"
student ".."
piscine ".."
) )
func main() { func main() {
root := &student.TreeNode{Data: "4"} root := &piscine.TreeNode{Data: "4"}
student.BTreeInsertData(root, "1") piscine.BTreeInsertData(root, "1")
student.BTreeInsertData(root, "7") piscine.BTreeInsertData(root, "7")
student.BTreeInsertData(root, "5") piscine.BTreeInsertData(root, "5")
min := student.BTreeMin(root) min := piscine.BTreeMin(root)
fmt.Println(min.Data) fmt.Println(min.Data)
} }
``` ```
@ -39,8 +40,8 @@ func main() {
And its output : And its output :
```console ```console
student@ubuntu:~/student/btreemin$ go build student@ubuntu:~/student/test$ go build
student@ubuntu:~/student/btreemin$ ./btreemin student@ubuntu:~/student/test$ ./test
1 1
student@ubuntu:~/student/btreemin$ student@ubuntu:~/student/test$
``` ```

21
subjects/btreemin.fr.md
unescape_control_characters View File

@ -2,7 +2,7 @@
### Instructions ### Instructions
Write a function, BTreeMin, that returns the node with the minimum value in the tree given by root Write a function, `BTreeMin`, that returns the node with the minimum value in the tree given by root
This function must have the following signature. This function must have the following signature.
@ -23,15 +23,16 @@ package main
import ( import (
"fmt" "fmt"
student ".."
piscine ".."
) )
func main() { func main() {
root := &student.TreeNode{Data: "4"} root := &piscine.TreeNode{Data: "4"}
student.BTreeInsertData(root, "1") piscine.BTreeInsertData(root, "1")
student.BTreeInsertData(root, "7") piscine.BTreeInsertData(root, "7")
student.BTreeInsertData(root, "5") piscine.BTreeInsertData(root, "5")
min := student.BTreeMin(root) min := piscine.BTreeMin(root)
fmt.Println(min.Data) fmt.Println(min.Data)
} }
``` ```
@ -39,8 +40,8 @@ func main() {
And its output : And its output :
```console ```console
student@ubuntu:~/student/btreemin$ go build student@ubuntu:~/student/test$ go build
student@ubuntu:~/student/btreemin$ ./btreemin student@ubuntu:~/student/test$ ./test
1 1
student@ubuntu:~/student/btreemin$ student@ubuntu:~/student/test$
``` ```

Write Preview
Loading…
Cancel
Save