had a fun evening playing around with C++ red-black tree implementations found on the web, while making an assignment for a software engineering class -- almost all of them are wrong, often disgracefully so
-
-
I'll walk on broken glass covered in lemon juice before I ever make another attempt at AVL trees
-
LLRB trees are the choice for sane people: https://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf …. At least if you're making an intrusive data structure or your hands are tied by iterator invalidation requirements... Rust ended up only having a B-Tree as the standard ordered map implementation for a reason.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.