Time Complexity | BST | AVL | Splay | RB-tree | B+ tree(M) |
---|---|---|---|---|---|
Search | O(n) | O(logn) | O(logn) | O(logn) | O ( l o g M / 2 n ) O(log_{M/2}n) O(logM/2n) |
Insert | O(n) | O(logn) | O(logn) | O(logn) | O ( M l o g M l o g n ) O(\frac{M}{logM}logn) O(logMMlogn) |
Delete | O(n) | O(logn) | O(logn) | O(logn) | O ( M l o g M l o g n ) O(\frac{M}{logM}logn) O(logMMlogn) |
Time Complexity
最新推荐文章于 2024-05-04 04:55:54 发布