This visualisation uses AI Generated code, finetuned for the best visualisation, not code quality

Interactive C + Raylib visualizer for understanding B+ tree insertion, separator propagation, point search, and range scans through linked index and leaf views.

• How keys enter a leaf and trigger local ordering
• How splits propagate upward and create new separator keys
• How point queries descend through internal routing nodes
• How leaf links make range scans efficient after the search reaches the first match

flowchart LR
    A["Insert Key"]
    B["Leaf Placement"]
    C["Leaf Split"]
    D["Internal Separator Propagation"]
    E["Point Search"]
    F["Leaf-Linked Range Scan"]

    A --> B
    B --> C
    C --> D
    D --> E
    E --> F

• q: quit
• space: pause or resume
• r: reset the current scene
• Search and range pages expose their extra keyboard hints in the on-screen footer

make run