Lines Matching full:rank

105 .Nd "implementations of splay and rank-balanced (wavl) trees"
211 splay trees and rank-balanced (wavl) trees.
380 .Sh RANK-BALANCED TREES
381 Rank-balanced (RB) trees are a framework for defining height-balanced
383 Each tree node has an associated rank.
385 rank between any node and its children.
386 Rank differences are stored in each tree node.
400 A rank-balanced tree is headed by a structure defined by the
505 The rank-balanced tree can also be initialized statically by using the
611 macro should be used to check whether a rank-balanced tree is empty.
670 The following example demonstrates how to declare a rank-balanced tree
804 .%T "Rank-Balanced Trees"