Go-算法记录

1、二叉树插入排序

package main

import (
	"fmt"
	"github.com/sirupsen/logrus"
)

type tree struct {
	value       int
	left, right *tree
}

func main() {
	var arr = []int{-9, 4, 10, 3, 23, 11, 6, 1, -2, 0, 19, 13, 10, 14, 5}
	Sort(arr)
	//[-9 -2 0 1 3 4 5 6 10 10 11 13 14 19 23]
	fmt.Println(arr)
}

func Sort(values []int) {
	var root *tree
	for _, v := range values {
		root = add(root, v)
	}
	logrus.Printf("%+v\n", root)
	appendValues(values[:0], root)
}

func appendValues(values []int, t *tree) []int {
	if t != nil {
		values = appendValues(values, t.left)
		values = append(values, t.value)
		values = appendValues(values, t.right)
	}
	return values
}

func add(t *tree, value int) *tree {
	if t == nil {
		t = new(tree)
		t.value = value
		return t
	}

	if value < t.value {
		t.left = add(t.left, value)
	} else {
		t.right = add(t.right, value)
	}
	return t
}