   
       self =
         I: I
+        root: -> root
       
         clear: -> root.clear()
       

          I.children.push(item)
          
          if (I.depth >= I.maxDepth) && (I.children.length > I.maxChildren)
            self.subdivide()
            
            I.children.each (child) ->

        return index
        
      self =
        I: I
        
        clear: ->
          I.children.clear()
          
