Lines Matching refs:left
29 struct heap_node* left;
84 if (child->left == child) {
85 child->left = parent;
89 sibling = child->left;
94 if (parent->left != NULL)
95 parent->left->parent = parent;
101 else if (child->parent->left == parent)
102 child->parent->left = child;
116 newnode->left = NULL;
121 * heap so we always insert at the left-most free node of the bottom row.
134 child = &(*child)->left;
164 /* Calculate the path from the min (the root) to the max, the left-most node
177 max = &(*max)->left;
203 child->left = node->left;
207 if (child->left != NULL) {
208 child->left->parent = child;
217 } else if (node->parent->left == node) {
218 node->parent->left = child;
229 if (child->left != NULL && less_than(child->left, smallest))
230 smallest = child->left;