Complexity of Estrin polynomial evaluation
The question is not particularly clear, but if I'm correct to assume that you're asking about Estrin's scheme for polynomial evaluation then Wikipedia confirms that it uses $n + \lfloor \lg n \rfloor$ multiplications.