(Solved): 28. Draw the expression tree and find the infix and postfix expressions for the following prefix ex ...

28. Draw the expression tree and find the infix and postfix expressions for the following prefix expression: $\mathrm{X}??\mathrm{B}+\mathrm{x}\mathrm{CD}/\mathrm{E}P$ 29. Draw the expression tree and find the infix and prefix expressions for the following postfix expression: $\text{ A B }\times \mathrm{CD}/+\mathrm{E}F?x$ 30. Show the result of the recursive function in Algorithm $6?9$ using the tree in Figure 6-26. 5-9 Tree Traversal for Exercise 30 Algorithm treetraversal (tree) 1 if tree is null 1 print "Nu11" 2 -else 1 treetraversal (right subtree) 2 print "right is done" 3 treetraversal (left subtree) 4 print (tree data) 3 end if end treeTraversal 31. Supply the missing firctor (the question mark) in the following recursive definition (Figure 6-28) of the maximum number of nodes based on the height of a binary tree. $N(H)=\left[\begin{array}{ll}1& \text{ if }H=1\\ N(H?1)+?& \text{ if }H?2\end{array}\right]$