Do any languages give you min/max at the same time with their standard library d... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		NavinF on Sept 3, 2020 \| parent \| context \| favorite \| on: On modern hardware the min-max heap beats a binary... Do any languages give you min/max at the same time with their standard library data structures? (setting the key function with "key=lambda x: -x" is really easy and works just like changing a comparator function in other languages so I dunno why you guys are talking about it)

ghj on Sept 3, 2020 [–]

Yes actually. Both c++ and java have red black trees. In c++ it's std::set, in java it's TreeSet.

BST supports log(n) min/max/inserts/removes (among other stuff).

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact