dist/webdb.umd.js
function rightTooSmall(node) {
		if (balanceFactor(node) <= 1) { return node; }   // Right is not too small, don't change
		if (balanceFactor(node.left) < 0) {leftRotation(node.left);}
		return rightRotation(node);
	}
function rightTooSmall(node) {
		if (balanceFactor(node) <= 1) { return node; }   // Right is not too small, don't change
		if (balanceFactor(node.left) < 0) {leftRotation(node.left);}
		return rightRotation(node);
	}
function rightTooSmall ( node ) { if ( balanceFactor ( node ) <= 1 ) { return node ; } // Right is not too small, don't change if ( balanceFactor ( node . left ) < 0 ) { leftRotation ( node . left ) ; } return rightRotation ( node ) ; }
Modify the tree if its right subtree is too small compared to the left
Return the new root if any
Modify the tree if its right subtree is too small compared to the left Return the new root if any