github.com/sevagh/k-ary-tree (go): Package karytree implements a recursive k-ary tree data structure.  The children of the tree is a slice of Node pointers.  The slice of children is originally uninitialized, but is filled with k nils when any one child is set.  The tree also stores the value of k. The caller is responsible for in-range indexing (e.g. don't set a 5th child of a k=3 node).
Keywords: datastructures|generics|kary-tree|n-ary-tree|recursive-data-structures|tree