Tip
| Red-Black Tree | Your Girlfriend |
|---|---|
| Search is bounded by O(log n) time | Search time is unbounded |
| Unlimited O(log n) insertion operations followed by a sequence of rotations | Limited number of insertion operations that can imply no movement at all |
| Cannot have two consecutive red nodes | Period every month |
| Takes O(n) space | Takes all the space in the bathroom and closet |
| Fast construction, insertion, search and deletion parallel algorithms | Parallelization takes a lot of effort |
- Студент:
Барсуков Максим Андреевич - Группа:
P3315 - ИСУ:
367081 - Функциональный язык:
Elixir
Интерфейс — Red-Black Tree, структура данных — Set.
...