@@ -4,6 +4,7 @@ Given an implementation of a binary search tree including parent pointers:
...
@@ -4,6 +4,7 @@ Given an implementation of a binary search tree including parent pointers:
- implement `splay` method, preferably utilizing the provided `rotate` operation
- implement `splay` method, preferably utilizing the provided `rotate` operation
performing a single rotation;
performing a single rotation;
- update `lookup`, `insert` and `remove` methods to utilize it correctly.
- 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
You should submit the `splay_operation.*` file (but not the
