Lines Matching refs:right
70 ref Node* right() { return kid[1]; }
79 if (!which.right) which = which.left;
80 else if (!which.left) which = which.right;
85 // Crude randomization: alternate left/right choices
137 if (!n.left && !n.right) return;
139 recurse(n.right, indent + 4);
160 if (n.left || n.right)
165 recurse(n.right);
199 which.right = null;
209 which.right = null;
230 assert(sis.right is null);
234 && isBST(n.right, max(lb, n.size), ub);
329 // deliberately don't initialize which.left and which.right
387 recurse(n.right);