Learning Go programming
-
Simple DiffTree to compare that trees are same by labels for testing. What is a representation for such diff? It's great to have a tree as result. Values of such tree can be a couple (removed, added) values or nil
-
MergeTree method
> make test
Tree interface as a pair of Vertex and Forest? Forest as a Nil vertex with childs
Type theory