54 lines
2.2 KiB
Go
54 lines
2.2 KiB
Go
// This is a "stub" file. It's a little start on your solution.
|
|
// It's not a complete solution though; you have to write some code.
|
|
|
|
// Package binarysearchtree should have a package comment that summarizes what it's about.
|
|
// https://golang.org/doc/effective_go.html#commentary
|
|
package binarysearchtree
|
|
|
|
type SearchTreeData struct {
|
|
left *SearchTreeData
|
|
data int
|
|
right *SearchTreeData
|
|
}
|
|
|
|
// NewBst creates and returns a new SearchTreeData.
|
|
func NewBst(i int) SearchTreeData {
|
|
// Write some code here to pass the test suite.
|
|
// Then remove all the stock comments.
|
|
// They're here to help you get started but they only clutter a finished solution.
|
|
// If you leave them in, reviewers may protest!
|
|
return SearchTreeData{}
|
|
}
|
|
|
|
// Insert inserts an int into the SearchTreeData.
|
|
// Inserts happen based on the rules of a BinarySearchTree
|
|
func (std *SearchTreeData) Insert(i int) {
|
|
// Write some code here to pass the test suite.
|
|
// Then remove all the stock comments.
|
|
// They're here to help you get started but they only clutter a finished solution.
|
|
// If you leave them in, reviewers may protest!
|
|
}
|
|
|
|
// MapString returns the ordered contents of SearchTreeData as a []string.
|
|
// The values are in increasing order starting with the lowest int value.
|
|
// SearchTreeData that has the numbers [1,3,7,5] added will return the
|
|
// []string ["1", "3", "5", "7"].
|
|
func (std *SearchTreeData) MapString(func(int) string) (result []string) {
|
|
// Write some code here to pass the test suite.
|
|
// Then remove all the stock comments.
|
|
// They're here to help you get started but they only clutter a finished solution.
|
|
// If you leave them in, reviewers may protest!
|
|
return []string{}
|
|
}
|
|
|
|
// MapInt returns the ordered contents of SearchTreeData as an []int.
|
|
// The values are in increasing order starting with the lowest int value.
|
|
// SearchTreeData that has the numbers [1,3,7,5] added will return the
|
|
// []int [1,3,5,7].
|
|
func (std *SearchTreeData) MapInt(func(int) int) (result []int) {
|
|
// Write some code here to pass the test suite.
|
|
// Then remove all the stock comments.
|
|
// They're here to help you get started but they only clutter a finished solution.
|
|
// If you leave them in, reviewers may protest!
|
|
return []int{}
|
|
}
|