This is called infix notation infix preorder

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: nal form. This is called infix notation. infix Preorder traversal yields -++*627*83/67 in prefix notation. prefix + / + 7 3 7 * 6 6 * 8 7 3 2 15 Postorder traversal yields 6 2 * 7 + 8 3 * + 6 7 / This is called postfix notation. postfix But is better known as Reverse Polish. Reverse + 6 6 * 7 * This is the method most likely to be used by calculators and computers. / + 8 Postorder traversal yields 6 2 * 7 + 8 3 * + 6 7 / This is called postfix notation. postfix But is better known as Reverse Polish. Reverse 7 3 It uses a stack. Each node in postorder traversal is inspected. 2 62*7+83*+67/If it is a number, push it on the stack. If it is an operator, pop off the top two values, making them the right and left operands. ki th th Evaluate and push the result. Repeat until tree traversed. The value on the stack is the answer. USING AN ARRAY TO STORE A TREE All the data structures we have discussed can be stored in an array – some more easily than others. For trees, the overhead of two pointers per data item and the need for recursion are sometimes considered unnecessary. 62*7+83*+67/6:...
View Full Document

This document was uploaded on 04/07/2014.

Ask a homework question - tutors are online