kvs/main.go

package main

import (
	"fmt"

	"git.klmp200.net/klmp200/kvs/btree"
)

func main() {

	// Example program
	t := btree.NewBtree(3)
	t.Insert("animal", "dog")

	s, _ := t.Search("animal")
	fmt.Println(s)

	t.Insert("potato", "fries")
	t.Insert("6", "number")
	t.Insert("12", "number")
	t.Insert("car", "ferrari")
	t.Insert("7", "number")
	t.Insert("plane", "airbus")
	t.Insert("animal", "cat")

	s, _ = t.Search("animal")
	fmt.Println(s)

	fmt.Print("Traversal of the constructed tree is")
	t.Traverse()

	fmt.Println("")

	t.Visualize()

	if val, err := t.Search("6"); err != nil {
		fmt.Print("\nNot Present")
	} else {
		fmt.Printf("\nPresent: value '%s'", val)
	}

	if val, err := t.Search("15"); err != nil {
		fmt.Print("\nNot Present")
	} else {
		fmt.Printf("\nPresent: value '%s'", val)
	}

}