function inner(node)
	{
		nodes[pos] = node;
		pos+=1;
		if(!node._children || !node._children.length)
			return;
		for(var i = 0; i < node._children.length; ++i)
			inner( node._children[i] );
	}
all nodes are stored in an array, this function recomputes the array so they are in the right order in case one has changed order

@method recomputeNodesArray