Lines Matching full:leftmost
472 } else { /* could be dupes, find leftmost one */670 * successor (i.e. the leftmost node in the right subtree.) By doing this,855 * Return the node with the lowest (leftmost) key. If the dictionary is empty
