import java.util.*;

public class Test {

	public static void main(String[] args) throws Exception {

		System.out.println("Inserire Albero");
		
		Tree<Integer> t = TreeParser.readTree(); 
		System.out.println("Parsing Albero");
		TreeUtil.print(t); 
		
		MinHeap<String> h = new MinHeap<String>(); 
		
		h.insert(1, "Roma"); 
		h.insert(12, "Milano"); 
		h.insert(7, "Bologna"); 
		h.insert(5, "Firenze"); 
		
		System.out.println("Stampa Heap");
		while(!h.isEmpty())
		   System.out.println(h.removeMin()); 
		
		int[] v = { 3, 7, 1, 2, 8, 5, 0, -1, 4, 6 }; 
		System.out.println(Arrays.toString(v)); 
		MinHeap.heapsort(v); 
		System.out.println(Arrays.toString(v));
		
		// PER CASA ---------------------------------
		
		HeapEntry<String> r = h.insert(1, "Roma"); 
		HeapEntry<String> m = h.insert(12, "Milano"); 
		HeapEntry<String> b = h.insert(7, "Bologna"); 
		HeapEntry<String> f = h.insert(5, "Firenze"); 		
		
		h.remove(b); 
		h.replaceKey(m, 3); 
		h.replaceValue(f, "Orte"); 
		System.out.println("Stampa Heap Modificato");
		while(!h.isEmpty())
		   System.out.println(h.removeMin());  

	}

}