A Tour of Go in Haskell

GitHub Language
Exercise: Equivalent Binary Trees (1/2)

Different binary trees storing same elements can be of different shapes. Following two binary trees have same elements.

Using concurrency techniques we have seen, make a function to check whether two binary trees store same elements.

Here is the abstract data type of binary trees.

data Tree = Nil | Tree Int Tree Tree

See the next page.

< 7 / 11 >