Against my expectations, the code on top is noticeably slower than the code on the bottom, why?

• BinarySearchTreeExercises

  6 0 0.0 C++

  Practicing with Binary Search Trees

It is probably crude but this is what I have been playing with. The section at bottom is where I am basing this off of. But I am not running both versions at once. I have just been modifying class and running code for about 10 times each version separately. And did so more than once, maybe 3 times? https://github.com/sethvan/BinarySearchTreeExercise/blob/master/raw/insertRunTimes.cpp

• MGCLib

  2 1 0.0 C++

  A C++ Library of commonly used containers and libraries

I did not go with the left leaning version you attached because the paper intimidated me as soon as it mentioned 2-3 trees which I was not familiar with, however I have been slightly glancing at the repository from 2022 (which is where I based my node off of in part). Two observations I have made of that class and another piece of code https://pastebin.com/7GGFiaEc I had looked at for an AVL tree in C is that first I think it is very cool that they have so many functions that return a node value back to it's own variable like node = doSomething(node) so to speak instead of all the void methods that I have been doing (not only on my own but that this professor also showed for my present version of a red black tree here https://pastebin.com/m1aG7w4s ). So that's cool and suspect I need to try and think more in that mannner. BUT.... in neither of those versions do I see any memory being deleted or free'd nywhere. So i am confused, Why is there no destructor in this guy https://github.com/maxgoren/MGCLib/blob/main/mgc_redblack.hpp and why is nothing being deleted anywhere that I can see?

• InfluxDB

  www.influxdata.com featured

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

Suggest a related project