Lines Matching refs:left
80 #define LEFT(node) ((node)->left)
767 * means a left or right pointer was followed,
1257 * "b.c" is left hanging around without data or children. This condition
1267 * in the CVS history, but comments have been left behind that point to it just
1802 * This node has one child, on the left.
1819 * The successor cannot possibly have a left child;
1883 * Original location of successor node has no left.
2183 printf("** Red/Red color violation on left\n");
2281 * Moving left one then right as far as possible is the
2293 * No left links, so move toward the root. If at any point on
2529 * that was via a left link; the successor is the node that has
2530 * that left link. In the event the root of the level is
2531 * reached without having traversed any left links, ascend one
2533 * ascent, or search for a left link upward again, repeating
2550 * any left pointers, so this level is done.