If we found a factor , we construct left and right subtrees and return . Since we traverse factors starting from smaller to greater , left child will always have smaller factor
createFactorTree ( & ( ( * node_ref ) -> left ) , i ) ; createFactorTree ( & ( ( * node_ref ) -> right ) , v / i ) ; return ; } }