Valentin Bartenev b20e995e80 Timers: separation of delete and insert operations on rbtree. ...

Delete/insert operation complexity for a red-black tree is O(log n),
where n is the total number of tree elements.

If all delete operations are performed before all insert operations,
the average number of tree elements during an operation will be
lower than in the mixed-operations case.

2018-10-22 16:02:14 +03:00

7.8 KiB

Raw Blame History

View Raw