Project 4.20 defined infix and postfix notation. Draw a binary tree which produces the infix expression 3 + 2 * 4 when traversed inorder and the postfix expression 3 2 4 * + when traversed postorder....

Project 4.20 defined infix and postfix notation. Draw a binary tree which produces the infix expression 3 + 2 * 4 when traversed inorder and the postfix expression 3 2 4 * + when traversed postorder. What expression is produced if this tree is traversed preorder?

Ignoring the fact that the game may end before the entire board is filled, exactly how many nodes are there in the complete game tree for Tic Tac Toe? (This is a simple game. The trees for more complicated games like Chess and Go have more nodes than there are electrons in the universe!)