home

=[|beethoven]= = = =AP Computer Science= Teacher: Amber Krug-Wagner [|(Class Website)] [|Java API] == ===ASSIGNMENT FOR THURSDAY FEBRUARY 23: 1. Define a priority queue. 2. Write a class FoodOrder (similar to WorkOrder page 826). Use a MinHeap as a priority queue to place 5 orders. Then remove the orders and print them out. 3. Don't forget to bring supplies for tomorrow! You don't need to turn the assignment in, we will discuss it tomorrow.=== == =__Notes__= (2/16/2006) Types of binary tree traversal: inorder - left, node, right preorder - node, left, right postorder - left, right, node

Reverse Polish Notation:

Polish notation was invented by Jan Lukasiewicz in the 1920s to solve the problems associated with algebraic notation. Instead of (3+4)*5, he wrote *+345. It did not gain much publicity until Hewlett-Packard introduced the HP 35 calculator, which used reverse Polish notation (345*+). That enabled it to perform algebraic operations without having to write down intermediate results, a unique feature among calculators at the time. They advertised it as, "The calculators that have no equal." Modern calculators can now support standard algebraic notation, but HP still makes calculators with this feature. For more information see [|this Wikipedia article].