.. (לתיקייה המכילה) | ||
It isn't clear to me how the different operations of a splay tree should work. | |
Please refer to the file "splay_tree.pdf" that was recently added to the exercise files. You should implement your methods accordingly. |
Must we implement the splay tree as described in the recently added pdf file? If yes, can we add our own functions to it as well? | |
Implementing the splay tree according to the pdf file is highly recommended, and if you do so you do not need to describe your splay tree implementation in more than a few words. Nevertheless, you are allowed to implement in a different way, as long as your implementation satisfies the complexity requirements, and as long as you describe how you implemented your functions. Specifically, a simple BST implementation of find/insert/delete is NOT sufficient. |
In case of an unsuccessful find(), must we splay the last (non-null) node reached? | |
Yes. The same goes to unsuccessful deletes and inserts. |
When performing a search in the tree (e.g. Inorder), must we splay every node we reach? | |
No. You should splay only when performing the Find (including find-min and find-max), Insert and Delete operations. |
Which g++ version will be used for compiling our assignment? | |
Your assignment will be compiled using the default g++ 4.4.7 Note that you cannot use C++11, and there is no need for it. You can check your current g++ version using: g++ --version |
How can I revert my g++ version? | |
In case you've changed your g++ version by editing .bashrc, simply remove the following line from the file: . /usr/local/gcc4.7/setup.sh and re-login to your account |