Lines Matching defs:node
56 struct heap_node* node,
120 * heap so we always insert at the left-most free node of the bottom row.
138 /* Insert the new node. */
143 /* Walk up the tree and check at each node if the heap property holds.
151 struct heap_node* node,
163 /* Calculate the path from the min (the root) to the max, the left-most node
183 /* Unlink the max node. */
187 if (child == node) {
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. */
196 child->left = node->left;
197 child->right = node->right;
198 child->parent = node->parent;
208 if (node->parent == NULL) {
210 } else if (node->parent->left == node) {
211 node->parent->left = child;
213 node->parent->right = child;
216 /* Walk down the subtree and check at each node if the heap property holds.
231 /* Walk up the subtree and check that each parent is less than the node
232 * this is required, because `max` node is not guaranteed to be the