Consider a 2 player zero-sum game, where MIN plays first; MAX is an optimal player; and MIN is a suboptimal player. Draw a game tree where MAX could perform better by deviating from the minimax algorithm.

I know tic-tac-toe could be an easy example of a 2 player zero-sum game, but how do I come up with an example in a tree form? Could MAX be X and min be O and somehow I need to think of a gamestate where O goes first but X could win if I ignore minimax? Any help is appreciated.