Lines Matching refs:trees

9 What are red-black trees, and what are they for?
12 Red-black trees are a type of self-balancing binary search tree, used for
13 storing sortable key/value data pairs.  This differs from radix trees (which
19 Red-black trees are similar to AVL trees, but provide faster real-time bounded
26     There are a number of red-black trees in use in the kernel.
32     trees, as are epoll file descriptors, cryptographic keys, and network
38   Linux Weekly News article on red-black trees
41   Wikipedia entry on red-black trees
44 Linux implementation of red-black trees
171 sorted order.  These work on arbitrary trees, and should not need to be
200 search trees, such as for traversals or users relying on a the particular
213 which permits augmented trees to be supported as well as only a few extra
221 trees::
285 More details about interval trees: