2 files changed, 10 insertions, 5 deletions
diff --git a/tree.c b/tree.c
index 2a5334a2..1f9bd9ff 100644
--- a/tree.c
+++ b/tree.c
@@ -519,32 +519,32 @@ val tree_insert_node(val tree, val node)
   return node;
 }
 
-static val tree_insert(val tree, val key)
+val tree_insert(val tree, val key)
 {
   return tree_insert_node(tree, tnode(key, nil, nil));
 }
 
-static val tree_lookup_node(val tree, val key)
+val tree_lookup_node(val tree, val key)
 {
   val self = lit("tree-lookup-node");
   struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_s));
   return tr_lookup(tr, key);
 }
 
-static val tree_lookup(val tree, val key)
+val tree_lookup(val tree, val key)
 {
   val node = tree_lookup_node(tree, key);
   return if2(node, node->tn.key);
 }
 
-static val tree_delete_node(val tree, val key)
+val tree_delete_node(val tree, val key)
 {
   val self = lit("tree-delete-node");
   struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_s));
   return tr_delete(tree, tr, key);
 }
 
-static val tree_delete(val tree, val key)
+val tree_delete(val tree, val key)
 {
   val node = tree_delete_node(tree, key);
   return if2(node, node->tn.key);
diff --git a/tree.h b/tree.h
index 0ee9cb0a..690cd91b 100644
--- a/tree.h
+++ b/tree.h
@@ -43,6 +43,11 @@ val copy_search_tree(val tree);
 val make_similar_tree(val tree);
 val treep(val obj);
 val tree_insert_node(val tree, val node);
+val tree_insert(val tree, val key);
+val tree_lookup_node(val tree, val key);
+val tree_lookup(val tree, val key);
+val tree_delete_node(val tree, val key);
+val tree_delete(val tree, val key);
 val tree_begin(val tree);
 val tree_begin_at(val tree, val lowkey);
 val tree_reset(val iter, val tree);