Lines Matching full:trees

105 .Nd "implementations of splay and rank-balanced (wavl) trees"
210 These macros define data structures for different types of trees:
211 splay trees and rank-balanced (wavl) trees.
243 .Sh SPLAY TREES
380 .Sh RANK-BALANCED TREES
381 Rank-balanced (RB) trees are a framework for defining height-balanced
382 binary search trees, including AVL and red-black trees.
389 (wavl) trees, which combine the best aspects of AVL and red-black
390 trees.
391 Wavl trees rebalance after an insertion in the same way AVL trees do,
392 with the same worst-case time as red-black trees offer, and with
394 Wavl trees rebalance after a removal in a way that requires less
395 restructuring, in the worst case, than either AVL or red-black trees
804 .%T "Rank-Balanced Trees"
805 .%U "http://sidsen.azurewebsites.net/papers/rb-trees-talg.pdf"