code: function(low, high, event){
  	//the event container
  	this.event = event;
  	//the low value
  	this.low = low;
  	//the high value
  	this.high = high;
  	//the high value for this and all child nodes
  	this.max = this.high;
  	//the nodes to the left
  	this._left = null;
  	//the nodes to the right
  	this._right = null;
  	//the parent node
  	this.parent = null;
  	//the number of child nodes
  	this.height = 0;
  }
docs: ///////////////////////////////////////////////////////////////////////// INTERVAL NODE HELPER ///////////////////////////////////////////////////////////////////////// 
  Represents a node in the binary search tree, with the addition
  of a "high" value which keeps track of the highest value of
  its children.
  References:
  https://brooknovak.wordpress.com/2013/12/07/augmented-interval-tree-in-c/
  http://www.mif.vu.lt/~valdas/ALGORITMAI/LITERATURA/Cormen/Cormen.pdf
  @param {Number} low
  @param {Number} high
  @private