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.
2574 Commits
76 Branches
1 Tag
311 MiB
 
 
 
 
 
 
Tree: 46f4ddc49e
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '46f4ddc49e'
${ noResults }
public/subjects/btreemin
xpetit 46f4ddc49e
Simplify prompt, execution of Go programs, fix typos 		3 years ago
..
README.md Simplify prompt, execution of Go programs, fix typos 3 years ago

README.md

btreemin

Instructions

Write a function, BTreeMin, that returns the node with the minimum value in the tree given by root

Expected function

func BTreeMin(root *TreeNode) *TreeNode {

}

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")
	min := piscine.BTreeMin(root)
	fmt.Println(min.Data)
}

And its output :

$ go run .
1
$