Contract to implement about binary search trees
size of the tree is the number of internal nodes (2 children node) of the tree - size :: Num a => Tree b -> a
rephrasing the sentence.
toList :: Tree a -> [a]
fromList :: Ord a => [a] -> Tree a
toSortedList :: Tree a -> [a]
smallValue :: Tree a -> Maybe a
Formatting
greatValue :: Tree a -> Maybe a
mirror :: Tree a -> Tree a
Changing the type by removing the Empty
Remove the empty function now that's no longer possible
Formatting
contains :: Ord a => Tree a -> a -> Bool
rightSon :: Tree a -> Tree a
leftSon (Leaf x) = (Leaf x)
Adding the Empty as a possible tree
insert :: Ord a => Tree a -> a -> Tree a
isBSearchTree :: (Ord a) => Tree a -> Bool
Adding sample