Function newNode

sorting/treesort.go:18–20

allocating a new node

(val int)

// allocating a new node
func newNode(val int) *node {
	return &node{val, nil, nil}
}

// insert nodes into a binary search tree
func insert(root *node, val int) *node {