Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
tom_mellior
on Dec 30, 2020
|
parent
|
context
|
favorite
| on:
C Template Library
The STL's complexity requirements pretty much dictate a balanced binary search tree as the underlying representation for map and set. The choice then is essentially between red-black trees and AVL trees.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
