AATree/testTree.hs


1
2
3
4
5
6
7
8
9
10

import AATree

setup = foldl insert Nil [1..20]

main = do
    let t = setup
    putStrLn (show $ foldr (:) [] t)

sort [] = []
sort (x:xs) = sort [ i | i<-xs, i<x]  ++  x:(sort [ i | i<-xs, i>=x])