Binary Tree in Haskell
Introduction Binary trees have internal structure; for any given node, all elements to the left are less than the current value, and all elements to the right are greater than the current value. For instance: 5 /--+--\ 3 6 /-+-\ 1 2 Lets build a binary...