GROUP WORK - Partially Ordered Trees and Heaps

1. Show the result of inserting 5, 3, 6, 8, 2, 9, 1 into a POT
	
	
	








2. Show the result of inserting Z, E, B, R, A, S into a POT
	
	
	








3. What are the heap representations of the trees in problems 1 and 2.
	
	
	
	1 3 2 8 5 9 6

	A B E Z R S



4. Show the result of buildHeap on 5, 3, 6, 8, 2, 9, 1

	private void buildHeap() {
		for(int i = currentSize / 2; i > 0; i--)
			percolateDown(i);
	}

	1 2 5 8 3 9 6 
	
	3 5 6 8 9 (After deleteMin was performed twice)


5. Perform two deleteMin operations on BOTH problems 1 and 2.

	E R S Z
	3 5 6 8 9