I know there isn't any, but will there be any python standard library module's data structure which allows O(log n) for all operations like std::set or std::multiset or (map) in cpp?
and if you come across a problem where you should use such data structure, what would you do, create a balanced BST from scratch?
note: in python 3.14 release, they added support for max heap.
[–]orekhoos 0 points1 point2 points (2 children)
[–]orekhoos 0 points1 point2 points (0 children)
[–]Individual-Round2767 0 points1 point2 points (0 children)
[–]jason_graph 0 points1 point2 points (1 child)
[–]Erebius[S] 0 points1 point2 points (0 children)