Comments on snippet: 'Compare Binary Search Trees (flawed)'

Comments on snippet: 'Compare Binary Search Trees (flawed)' http://snipplr.com Snipplr comments feed' en-us Wed, 22 May 2013 18:13:01 GMT deepsoul said on 9/17/09 http://snipplr.com/view/18966/compare-binary-search-trees-flawed/ Tree a -> Tree a -> Bool treeEq Empty Empty = True treeEq _ Empty = False treeEq Empty _ = False treeEq ta@(Node a ta1 ta2) tb@(Node b tb1 tb2) = a == b && treeEq ta1 tb1 && treeEq ta2 tb2 instance (Ord a) => Eq (Tree a) where (==) = treeEq ]]> Thu, 17 Sep 2009 15:16:48 GMT http://snipplr.com/view/18966/compare-binary-search-trees-flawed/