The question is intended as a self-test for readers. Answers may be found in Appendix C.
In a binary tree used to represent a mathematical expression, which of the following is not true?
a. Both children of an operator node must be operands.
b. Following a postorder traversal, no parentheses need to be added.
c. Following an inorder traversal, parentheses must be added.
d. In pre-order traversal a node is visited before either of its children.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.