6篇文章 · 4176字 · 2人关注
Let a and b > 1 be constants, let f(n) be a function, and let T(n) be de...
Augmenting data structures Dynamic order statistics OS-Select(i) - retur...
Goal: get a search tree data structure that we can insert, delete and se...
Insert and delete insert 的整个思路很简单。其实只能加在最下面。所以从root开始，每次比较当前node的值和需要ins...
Tree insert: searchs for that element A[i]Tree walk: Theorem: E[height o...
A fundamental weakness of hashing:For any choice of hash function, there...
文集作者