hash tables data structures
which data structure is the best for paging ? hash table , binary search or stack and why ?
Linked lists – because you can chain them in the order you need to and it is easist to remove an element from. You just change the pointer in the node(s) pointing to the element you want to remove.
CS 61B Lecture 34: Splay Trees
Categories: Uncategorized