function testRightTableColumnIndexed() {
  var treeBefore =
      'project()\n' +
      '-join(type: inner, impl: hash, join_pred(TableA.id eq TableC.id))\n' +
      '--table_access(TableC)\n' +
      '--table_access(TableA)\n';

  var treeAfter =
      'project()\n' +
      '-join(type: inner, impl: index_nested_loop, ' +
          'join_pred(TableA.id eq TableC.id))\n' +
      '--table_access(TableC)\n' +
      '--no_op_step(TableA)\n';

  lf.testing.treeutil.assertTreeTransformation(
      constructTree2(true), treeBefore, treeAfter, pass);
}
Tests a simple tree, where
 - Only one join predicate exists.
 - Only the column of the right table has an index.
Ensures that index join is chosen for the right table.