Lines Matching full:tree

12 Red-black trees are a type of self-balancing binary search tree, used for
21 three rotations, respectively, to balance the tree), with slightly slower
31     red-black tree.  Virtual memory areas (VMAs) are tracked with red-black
52 tree implementations.  Instead of using pointers to separate rb_node and data
55 users are expected to write their own tree search and insert functions
62 Data nodes in an rbtree tree are structures containing a struct rb_node member::
81 Writing a search function for your tree is fairly straightforward: start at the
109 Inserting data in the tree involves first searching for the place to insert the
110 new node, then inserting the node and rebalancing ("recoloring") the tree.
136   	/* Add new node and rebalance tree. */
146 To remove an existing node from a tree, call::
148   void rb_erase(struct rb_node *victim, struct rb_root *tree);
159 To replace an existing node in a tree with a new one with the same key, call::
162   			struct rb_root *tree);
164 Replacing a node this way does not re-sort the tree: If the new node doesn't
174   struct rb_node *rb_first(struct rb_root *tree);
175   struct rb_node *rb_last(struct rb_root *tree);
180 of the tree, which will return a pointer to the node structure contained in
181 the first or last element in the tree.  To continue, fetch the next or previous
203 potentially expensive tree iterations. This is done at negligible runtime
216   struct rb_node *rb_first_cached(struct rb_root_cached *tree);
270 - A tree rotation callback, which copies the augmented value for a given
283 Interval tree is an example of augmented rb tree. Reference -