From 9e36e66684a5c7bfc7cffdd7ecd245a891729b9d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Pavel=20Vesel=C3=BD?= <vesely@iuuk.mff.cuni.cz>
Date: Fri, 14 Oct 2022 15:06:36 +0200
Subject: [PATCH] splay_operation: specifying remove operation

---
 02-splay_operation/task.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/02-splay_operation/task.md b/02-splay_operation/task.md
index fe16abf..18d722a 100644
--- a/02-splay_operation/task.md
+++ b/02-splay_operation/task.md
@@ -4,6 +4,7 @@ Given an implementation of a binary search tree including parent pointers:
 - implement `splay` method, preferably utilizing the provided `rotate` operation
   performing a single rotation;
 - update `lookup`, `insert` and `remove` methods to utilize it correctly.
+You can implement the `remove` operation in more ways. However, if it is not the one presented in the lecture, you should provide a reference to the proof that it has the right amortized efficiency (e.g., a reference to a standard textbook).
 
 You should submit the `splay_operation.*` file (but not the
 `splay_operation_test.*`).
-- 
GitLab