ibst/ibst.js

Interval binary search tree

var node = require("./lib/node");
var ibst = function(nodes){        
    this.root = null;        
    this.insert = function(nodes){
        if(!nodes){
            return {status:false};
        }
        switch(nodes.constructor){
            case Object:
                if(Object.keys(nodes).length === 0){
                    return {status:false};
                }
                if(this.root){
                    return this.root.insert(nodes);
                }else{
                    this.root = new node(nodes);
                    return {status:true};
                }                  
            case Array:
                if(nodes.length === 0){
                    return {status:false};
                }
                var tree = this;
                nodes.map(function(node){
                    tree.insert(node);
                });
                return {status:true};                
        }        
    }
    this.count = function(){
        var test = JSON.stringify(this);
        var count = (test.match(/__count__/g) || []).length;
        return count;
    }
    this.search = function(query){
        return this.root.search(query);
    }
    if(nodes){
        this.insert(nodes);
    }
}

module.exports = ibst;