Lines Matching refs:left
28 struct heap_node* left;
83 if (child->left == child) {
84 child->left = parent;
88 sibling = child->left;
93 if (parent->left != NULL)
94 parent->left->parent = parent;
100 else if (child->parent->left == parent)
101 child->parent->left = child;
115 newnode->left = NULL;
120 * heap so we always insert at the left-most free node of the bottom row.
133 child = &(*child)->left;
163 /* Calculate the path from the min (the root) to the max, the left-most node
176 max = &(*max)->left;
196 child->left = node->left;
200 if (child->left != NULL) {
201 child->left->parent = child;
210 } else if (node->parent->left == node) {
211 node->parent->left = child;
222 if (child->left != NULL && less_than(child->left, smallest))
223 smallest = child->left;