BinarySearchTreeExercises Alternatives

BinarySearchTreeExercises reviews and mentions

• How does one learn low latency programming?
  2 projects | /r/cpp_questions | 15 Mar 2023

  Trippy and kind of cool. Don't remember if I knew that. I did make this red black tree map last May though. The only problem is I wrote the code without the key being const, but because a major part of my tree changing methodology was using std::swap which at the time I couldn't figure out how to replicate involving a const key, I left it that way. Partially it was due to the basis coming from following a tutorial in Java I think. But since it was only affecting me at the time with the iterator, I did a hack with some lambdas to make the iterator operators work like this:

• General programming question, but asking it here as I suspect every language community is a little bit different. What is the correct balance between (extracting out as much logic as possible to other functions + making one's variable/method names explain the code) and (writing detailed comments)?
  3 projects | /r/cpp_questions | 14 May 2022

  This is theDS project that I have spent 2 weeks on and have not commented almost at all on. A red black tree map, I did not have anything well defined concerning how much I was going to end up doing with it, so it has evolved into what it is now. If I do anything more with it, it will probably be just to add in the rest of the special members and maybe 2 unary operators (+ and -) to the Iterator.

• Against my expectations, the code on top is noticeably slower than the code on the bottom, why?
  5 projects | /r/cpp_questions | 29 Apr 2022

  Regarding the formatting, it took me a little while but I installed clang-format and went through the options, it was close between google and gnu but I went with google. Does this look better? This is my current version of this class from my repository. RedBlackTree

• Is my version of this binary search tree erase() method monstrous because I'm still a noob or because it's going to be long no matter what or both?
  1 project | /r/cpp_questions | 21 Apr 2022

  The ordeal I have had with it makes me feel like it's full of duct tape and zip ties TBH. I am not in the know of benchmarking but using some timer class I found by googling; the run times for insertion and deletion of elements seem comparable between my raw version and the std::set. But like I indicated earlier, it is not a template class and we are only working with ints here. What I am wondering though is if an ideal erase() method is supposed really to be anywhere as long as mine turned out to be? Because seriously I felt like a dutch boy plugging holes on this thing for hours hahaha. Methods are below and entire class is available here https://github.com/sethvan/BinarySearchTreeExercise .

• A note from our sponsor - InfluxDB
  www.influxdata.com | 1 Sep 2025

  InfluxDB 3 OSS is now GA. Transform, enrich, and act on time series data directly in the database. Automate critical tasks and eliminate the need to move data externally. Download now. Learn more →