docs: public int last(int node) {
          while (true) {
              final int right = right(node);
              if (right == NIL) {
                  break;
              }
              node = right;
          }
          return node;
      }