Lines Matching defs:max
154 struct heap_node** max;
163 /* Calculate the path from the min (the root) to the max, the left-most node
171 max = &heap->min;
174 max = &(*max)->right;
176 max = &(*max)->left;
183 /* Unlink the max node. */
184 child = *max;
185 *max = NULL;
188 /* We're removing either the max or the last node in the tree. */
195 /* Replace the to be deleted node with the max node. */
232 * this is required, because `max` node is not guaranteed to be the