For 1D optimization, when we use Newton’s to find the root of f’(x), target function’s first derivative, why is it the case that “when it converges, and if f is quadratic, Netwon’s converges in 1 iteration.”

Does this mean, if f is quadratic, then Newton’s for finding roots of f will also converge in 1 iteration? or does this mean, if F, f’s indefinite integral function is quadratic, then it will converge in iteration?