concept right in category algorithms

appears as: right, right
Algorithms and Data Structures in Action

This is an excerpt from Manning's book Algorithms and Data Structures in Action.

In this example, product names are treated as the keys of a binary search tree, and so they define a total ordering (from left to right in the figure).

Listing 3.10 method RandomizedTreap::insert
function insert(key)                            #1
  return this.treap.insert(key, this.randomGenerator.next())        #2
Figure 5.5 Merging two partitions. On the left: one of the two lists is appended to the other by adding a new edge tail-to-head, and removing links from the array to the second list. On the right it is shown the result after the merge, with all head-pointers for array elements belonging to the appended list (elements 1 and 5 in the example) updated.