code: function(order,f) {
      if(arguments.length != 0) {
          this.order = order;
          this.root = this._allocateNode();
          this.root.isLeaf = true;
          this.root.level = 0;
          var that = this;
          this._diskWrite(this.root, function(root){
              that.root = root;
              that._updateRootNode(that.root, function(n){
                  that.comparator = function(a,b) {
                      if(a < b) {
                          return -1;
                      } else if(a > b){
                          return 1;
                      } else {
                          return 0;
                      }
                  };
                  that.merger = null;
                  // we notify we are ready
                  if(f!=null) {
                      f(that);
                  }
              })});
      }
  }
docs: @doc
  Implementation based on <http://www.gossamer-threads.com/lists/linux/kernel/667935>
  
   
  Tree
  
  Implements the interface of BinarySearchTree.Tree
  
  An implementation of an in memory B-Tree.