(* CS421 Fall 2006 MP3 *)

open Mp3common

(* Problem 1: You are not allowed to use any helper functions *)
(* 10 points *)
let rec find_min_v1 list = raise(Failure("Function not implemented.")) 

(* Problem 2: You have to use List.fold_left *)
(* 10 points *)
let find_min_v2 list = raise(Failure("Function not implemented."))

(* Problem 3*)
(* 10 points *)
let rec foldBinTree nodeFun leafFun emptyVal tree = raise(Failure("Function not implemented."))

(* Problem 4: You have to use foldBinTree *)
(* 10 points *)
let numEmptyNodes t = raise(Failure("Function not implemented."))

(* Problem 5 *)
(* 10 points *)
let rec isReverse t1 t2 = raise(Failure("Function not implemented."))

(* Problem 6 *)
(* 20 points *)

let rec bubble_up entry heap_tree  = raise(Failure("Function not implemented."))

(* Problem 7 *)
(* 5 points *)
let tobinary n = raise(Failure("Function not implemented.")) 

(* Problem 8 *)
(* 5 points *)
let rec path_to_int path = raise(Failure("Function not implemented."))

(* Problem 9 *)
(* 5 points *)
let insert heap_tree elt = raise(Failure("Function not implemented."))

(* Problem 10 *)
(* 5 points *)
let rec buildMinHeap elts = raise(Failure("Function not implemented."))

(* Problem 11 Extra Credit *)
(* 10 Points *)
let arrayFromTree tree = raise(Failure("Function not implemented."))