Lines Matching defs:max
155 struct heap_node** max;
164 /* Calculate the path from the min (the root) to the max, the left-most node
172 max = &heap->min;
175 max = &(*max)->right;
177 max = &(*max)->left;
182 /* Unlink the max node. */
183 child = *max;
184 *max = NULL;
195 /* We're removing either the max or the last node in the tree. */
202 /* Replace the to be deleted node with the max node. */
239 * this is required, because `max` node is not guaranteed to be the