function testSplit_Case5() {
  var tree = new lf.index.BTree('test', c, true);
  var keys = [
    -995, 371, 370, 369,
    368,  // New level created here
    367, 366, 365, 364, 363, 97, 98, 99, 100, 101,
    102,  // New level created here
    103, 104,  // Split leaf node with right link
    105, 106, 486,
    107, 108  // Split internal node with right link
  ];
  for (var i = 0; i < keys.length; ++i) {
    tree.add(keys[i], i);
  }

  var expected =
      '11[102|363]\n' +
      '_{2|20|12}_\n' +
      '2[98|100]  20[104|106]  12[366|369]\n' +
      '_{0|7|9}11  2{13|15|17}11  20{5|3|1}11\n' +
      '0[-995|97]  7[98|99]  9[100|101]' +
      '  13[102|103]  15[104|105]  17[106|107|108]' +
      '  5[363|364|365]  3[366|367|368]  1[369|370|371|486]\n' +
      '_{0/10}2  0{11/12}2  7{13/14}2' +
      '  9{15/16}20  13{17/18}20  15{19/21/22}20' +
      '  17{9/8/7}12  5{6/5/4}12  3{3/2/1/20}12\n';

  assertEquals(expected, tree.toString());
}
Tests split leaf and internal which have links to the right.

                              363
            /                                     \
         98|100                                 366|369
    /      |       \                    /          |         \
-995|97  98|99  100|101|102|103  363|364|365  366|367|368 369|370|371

 insert 104
                              363
               /                                       \
            98|100|102                              366|369
    /      |       \       \                /          |         \
-995|97  98|99  100|101  102|103|104  363|364|365  366|367|368 369|370|371