diff --git a/01-tree_successor/task.md b/01-tree_successor/task.md index 79e8b78090279ca6384e8a68402457482df31e62..44b76a3e9fdb2159102037fac47113f9a72652f0 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 b159af9fbed33c6bb6c6f4dfdf74f9d4edb80033..ea234ca633f4dfd9ff1da16039e477c5eaa34ad6 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.*`).