CIS2168
TEN MINUTE TEST # 7
October 26, 2010

(15)	1. Here is an expression in infix notation.
		7 + 12 / 4 - 5 < 2 + 3 * 4 / 5 + 3
	   Build the corresponding parse tree with as internal nodes the operators
	   [ask me to draw it if you want]
	   then traverse this tree in preorder, inorder, postorder








(15)	2. Implement the method 
		public static <E extends Comparable<E>> E findMax(BinaryTree<E> root)
	   which returns the largest value in the non null binary tree root.