From 60853fef7cf09104838e5d65e9271b37e9d23595 Mon Sep 17 00:00:00 2001
From: Milan Straka <milan@strakovi.com>
Date: Mon, 11 Mar 2019 20:53:40 +0100
Subject: [PATCH] Explictly state what to submit.

---
 01-tree_successor/task.md  | 3 ++-
 02-splay_operation/task.md | 3 +++
 2 files changed, 5 insertions(+), 1 deletion(-)

diff --git a/01-tree_successor/task.md b/01-tree_successor/task.md
index 79e8b78..44b76a3 100644
--- a/01-tree_successor/task.md
+++ b/01-tree_successor/task.md
@@ -7,4 +7,5 @@ and it should return another node of the tree with the next higher key
 - The given node can also be a null pointer, in which case the method should
   return the smallest node in the tree.
 
-You should submit the file `tree_successor.*`.
+You should submit the file `tree_successor.*` (but not the
+`tree_successor_test.*`).
diff --git a/02-splay_operation/task.md b/02-splay_operation/task.md
index b159af9..ea234ca 100644
--- a/02-splay_operation/task.md
+++ b/02-splay_operation/task.md
@@ -2,3 +2,6 @@ Given an implementation of a binary search tree including parent pointers:
 - implement `splay` method, possibly utilizing the provided `rotate` operation
   performing a single rotation;
 - update `lookup`, `insert` and `remove` methods to utilize it correctly.
+
+You should submit the `splay_operation.*` file (but not the
+`splay_operation_test.*`).
-- 
GitLab