💾 Archived View for gmi.noulin.net › gitRepositories › wavlTree › file › README.md.gmi captured on 2024-08-19 at 05:30:30. Gemini links have been rewritten to link to archived content
⬅️ Previous capture (2023-01-29)
-=-=-=-=-=-=-
README.md (745B)
1 # This repo
2 WAVL tree implementation in C, inspired by [dmcmanam/bbst-showdown (JAVA implementation)](https://github.com/dmcmanam/bbst-showdown).
3 All tests have passed and there is no memory leak(tested with valgrind).
4
5 # What is WAVL tree
6
7 WAVL tree is an attempt to combine the best characteristics of a AVL trees and red-black trees. Just inserting into a WAVL tree will
8 build the same tree as an AVL tree - one that is more strictly balanced than a red-black tree so WAVL trees can be expected to
9 perform better in situations where red-black trees become more unbalanced. Delete in WAVL is slightly simpler than delete for AVL
10 trees in that WAVL deletes perform only 1 or 2 rotations and stop instead of potentially all the way to the root.