In this paper, we consider discrete-time decentralized risk-averse LEQG teams, and show that the team-optimal solutions are identical to one of the solutions for minimax team problems. We first show the result for static teams, and extend the result to dynamic teams, with a quasi-classical information pattern, using a dynamic programming argument. In the process, we also establish differences between the two problems by pointing out the existence of multiple solutions to the minimax team problem, while there exists a unique solution to the LEQG team problem.