Implement balanced binary tree and refactor

[tiger.ml.git] / exercises / ch01 / tree_sig.ml

diff --git a/exercises/ch01/tree_sig.ml b/exercises/ch01/tree_sig.ml
deleted file mode 100644 (file)
index 4133a77..0000000
--- a/exercises/ch01/tree_sig.ml
+++ /dev/null
@@ -1,14 +0,0 @@
-module type S = sig
-  type ('k, 'v) t
-
-  val empty : ('k, 'v) t
-
-  val set : ('k, 'v) t -> k:'k -> v:'v -> ('k, 'v) t
-
-  val get : ('k, 'v) t -> k:'k -> 'v option
-
-  val member : ('k, 'v) t -> k:'k -> bool
-
-  val to_dot : ('k, 'v) t -> k_to_string:('k -> string) -> string
-end
-