Lines Matching refs:right
81 #define RIGHT(node) ((node)->right)
345 * Go as far right and then down as much as possible,
767 * means a left or right pointer was followed,
817 * the right node, the next call to
823 * was called and jump to the right place.
1796 * This node has one child, on the right.
1820 * if there is any child, it is on the right.
1957 * Child is parent's right child.
2187 printf("** Red/Red color violation on right\n");
2281 * Moving left one then right as far as possible is the
2294 * the way there the link from parent to child is a right
2317 * Go down and as far right as possible, and repeat
2346 * any right links. Ascend the tree one level; the
2532 * level and look for either a right link off the point of