data-structures in haskell

1 · Shane Mulligan · June 2, 2020, 4 p.m.
Original article Trees in Haskell | Dimitrios Kalemis Glossary 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 tree An undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph. forest An undirected graph in which any two vertices are connected by at most one path, or equivalently an acyclic undirected graph, or equivalently a disjoint union of trees....