Hello,
I am trying to use HtDF to create a function to sort a Binary Search Tree.
I am in an intro class so this may be a simple question. I did the
following:
;define-struct a node
(define-struct node (left value right))
;BTS leafs
(define a-node(make-node null "A" null))
(define b-node
I wanted to thank you all. I did it! My head hurts, but now seeing how
simple it was, it hurts that it hurts.
;leap year
(define (leap-year? year)
(and (zero? (modulo year 4))
(or (not (zero? (modulo year 100)))
(zero? (modulo year 400))
)
)
)
;Months with
2 matches
Mail list logo
