💾 Archived View for gmi.noulin.net › markdown › wavlTree_README.md captured on 2023-07-10 at 18:19:29.
-=-=-=-=-=-=-
# This repo WAVL tree implementation in C, inspired by [dmcmanam/bbst-showdown (JAVA implementation)](https://github.com/dmcmanam/bbst-showdown). All tests have passed and there is no memory leak(tested with valgrind). # What is WAVL tree 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 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 perform better in situations where red-black trees become more unbalanced. Delete in WAVL is slightly simpler than delete for AVL trees in that WAVL deletes perform only 1 or 2 rotations and stop instead of potentially all the way to the root.