roag

%%%6. Define a predicate list_of_divisors(N,L) which for a positive integer N
%%%   calculates the list of its proper divisors. (A proper divisor of n is a positive
%%%   integer m < n such that m divides n.)



divisor(N,P) :-
P>0,
N>P,
0 is N mod P.

roag

data Btree a = ND | Data a |  Branch (Btree a) (Btree a)
               deriving (Show,Eq)

data Dir = L | R 
           deriving (Show,Eq)

type Path =  [Dir] 
    
--- Part a)