Task system in C - Part 2.2 - Memory Management

แชร์
ฝัง
  • เผยแพร่เมื่อ 31 ม.ค. 2025

ความคิดเห็น • 4

  • @007kowalski
    @007kowalski 19 วันที่ผ่านมา +1

    great content! could you organize this one in a playlist?

  • @Airknightangel
    @Airknightangel 18 วันที่ผ่านมา

    This is absolutely immersive! Great job explaining your though process along the way! I am looking forward for the next part!
    Quick Question: Could this becoming an RB tree be a viable option for balancing in this case?

    • @invertedminds5331
      @invertedminds5331  3 วันที่ผ่านมา

      Thank you for the lovely comment! I will try to find some time to continue the series.
      Well, rb utilizes the fact that the ordering is preserved under rotations. In this tree the non-leaf node are summarizing, a bit more like the internal nodes of a van emde boas tree. However, maybe some coloring algorithm can still be found to quickly determine how to balance.