【ADS】Time Complexity 发表于 2020-01-26 | 分类于 Notes , Advanced Data Structure and Algorithm | | 阅读次数: Time Complexity BST AVL Splay RB-tree B+ tree(M) Search O(n) O(logn) O(logn) O(logn) $O(log_{M/2}n)$ Insert O(n) O(logn) O(logn) O(logn) $O(\frac{M}{logM}logn)$ Delete O(n) O(logn) O(logn) O(logn) $O(\frac{M}{logM}logn)$