B+Tree A minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix. Branch in-memory for learning and debugging. Demo ./demo_build.sh Code Coverage Test Note: Do NOT load an existing index file with same name for this testing! ./coverage_build.sh