#lang racket
(require htdp/testing)

;; file:  hw2pr1.rkt
;; name:
;; time spent:
;; other comments?


;; problem 1
;; superreverse (be sure to finish this comment - and the others!)
;;   inputs:
;;   output:
;; using higher-order functions (no raw recursion)
(define (superreverse L)
  0)



;; problem 2
;; using higher-order functions (no raw recursion)
(define (indivisible e L)
  0)





;; problem 3
;; using higher-order functions (no raw recursion)
(define (lotto-winner list-of-tickets winning-numbers)
  0)





;; a binary search tree for problems 4-6:
(define BT1 '( 42 
               (20 (7 (1 () ()) (8 () ())) (31 () (41 () ()))) 
               (100 (60 () ()) ()) )  )



;; problem 4 (first part)
(define (height BST)
  0)



;; problem 4 (second part)
(define (find-min BST)
  0)




;; problem 5 
(define (flatten-tree BST)
  0)




;; problem 6
(define (delete e BST)
  0)




;; problem 7
(define (make-change total coin-list)
  0)




;; problem 8
(define (gchildren N n G)
  0)





;; problem 9
(define (min-dist a b G)
  0)



(define (min-path a b G)
  0)



;; problem 10 uses Java at  CodingBat (http://codingbat.com/)




;; eventually you'll want to uncomment this line...
;(generate-report)



;; Extra credit: 20 questions and min-path