Algo Red Black Trees

Implement a red-black self-balancing BST (insert, rotations, recoloring) for O(log n) search on sorted VCF variant positions. Use when building a balanced BST, verifying invariants, or comparing red-black vs AVL trees.

pavel-kravchenko Updated

File contents

pavel-kravchenko/bioinformatics commit b28cc6b932

Frequently asked questions

npx get-skill add pavel-kravchenko/algo-red-black-trees