Lines Matching refs:tree

9 Red-black trees are a type of self-balancing binary search tree, used for
18 three rotations, respectively, to balance the tree), with slightly slower
28     red-black tree.  Virtual memory areas (VMAs) are tracked with red-black
49 tree implementations.  Instead of using pointers to separate rb_node and data
52 users are expected to write their own tree search and insert functions
59 Data nodes in an rbtree tree are structures containing a struct rb_node member:
78 Writing a search function for your tree is fairly straightforward: start at the
106 Inserting data in the tree involves first searching for the place to insert the
107 new node, then inserting the node and rebalancing ("recoloring") the tree.
133   	/* Add new node and rebalance tree. */
143 To remove an existing node from a tree, call:
145   void rb_erase(struct rb_node *victim, struct rb_root *tree);
156 To replace an existing node in a tree with a new one with the same key, call:
159   			struct rb_root *tree);
161 Replacing a node this way does not re-sort the tree: If the new node doesn't
171   struct rb_node *rb_first(struct rb_root *tree);
172   struct rb_node *rb_last(struct rb_root *tree);
177 of the tree, which will return a pointer to the node structure contained in
178 the first or last element in the tree.  To continue, fetch the next or previous
234 - A tree rotation callback, which copies the augmented value for a given
246 Interval tree is an example of augmented rb tree. Reference -