COMPUTER SCIENCE TRIPOS Part IA – 2022 – Paper 1 Algorithms 2 (djw1005) Consider a Dictionary whose keys belong to a totally ordered set, and whose […]
COMPUTER SCIENCE TRIPOS Part IA – 2022 – Paper 1 Algorithms 1 (fms27) Consider binary trees, represented as BinTree objects and whose nodes are represented as […]
Algorithms (a) A splay tree is a binary search tree with amortised complexity O(log(n)) per operation. (i) What is meant by amortised complexity? [1 mark] (ii) […]