docx, 94.97 KB
docx, 94.97 KB
docx, 171.42 KB
docx, 171.42 KB

The word document presents five questions asking for a translation from ‘infix’ to ‘postfix’ and five questions from ‘postfix’ to ‘infix’ notation. There is a question asking to convert a postfix expression into a binary tree and then requiring a traversal of the binary tree using preorder, post order and inorder traversal. There is a question asking about the purpose of RPN and another question asking why humans use infix notation and computers sometimes use postfix notation (x6 questions sub divided into sections)

Review

5

Something went wrong, please try again later.

mrsnsharp

5 years ago
5

A helpful set of questions to test understanding of the topic.

Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.