asdasd

/*
Complete your details...
Name and Surname: Stephen Swanepoel
Student/staff Number: 11032091
*/




public class Heap
{
	public static void main(String[] args)
	{
		/*Test your implementation in this file*/
            LeftistDHeap<Integer> heap1 = new LeftistDHeap<Integer>(3);
            LeftistDHeap<Integer> heap2 = new LeftistDHeap<Integer>(3);

            heap1.enqueue(3);
            heap1.enqueue(77);
            heap1.enqueue(11);
            heap1.enqueue(10);
            heap1.enqueue(15);

            System.out.println(heap1.breadthFirstSearch());
            //[4,5,6,7,11,8,50,22,19]
            heap2.enqueue(4);
            heap2.enqueue(6);
            heap2.enqueue(7);
            heap2.enqueue(5);
            heap2.enqueue(11);
            heap2.enqueue(8);
            heap2.enqueue(50);
            heap2.enqueue(19);
            heap2.enqueue(22);
            //System.out.println(heap2.depthFirstPreOrder());
            //System.out.println(heap2.depthFirstPostOrder());
            System.out.println(heap2.breadthFirstSearch());
            heap1.combine(heap2);
            System.out.println(heap1.breadthFirstSearch());
            LeftistDHeap<Integer> heap3 = new LeftistDHeap<Integer>(3);

            heap3.enqueue(2);
            heap3.enqueue(33);

            heap1.combine(heap2);
            heap1.combine(heap3);

            System.out.println("Merged heap");
            System.out.println(heap1.breadthFirstSearch());
            /*
            LeftistDHeap<Integer> heap1 = new LeftistDHeap<Integer>(3);
            LeftistDHeap<Integer> heap2 = new LeftistDHeap<Integer>(3);

            System.out.println("Enqeue into heap1: [3,77,11,10,15]");
            heap1.enqueue(3);
            heap1.enqueue(77);
            heap1.enqueue(11);
            heap1.enqueue(10);
            heap1.enqueue(15);
            System.out.println("breadthFirstSearch: " + heap1.breadthFirstSearch());
            System.out.println();

            System.out.println("Enqeue into heap2: [4,6,8,50,22]");
            //[4,5,6,7,11,8,50,22,19]
            heap2.enqueue(4);
            heap2.enqueue(6);
            heap2.enqueue(8);
            heap2.enqueue(50);
            heap2.enqueue(22);
            System.out.println("breadthFirstSearch: " + heap2.breadthFirstSearch());
            System.out.println();

            System.out.println("Combine heap1 with heap2");
            heap2.combine(heap1);
            System.out.println();

            System.out.println("depthFirstPreOrder: " + heap2.depthFirstPreOrder());
            System.out.println("depthFirstPostOrder: " + heap2.depthFirstPostOrder());
            System.out.println("breadthFirstSearch: " + heap2.breadthFirstSearch());
            System.out.println();

            System.out.println("dequeue from heap2 : " +  heap2.dequeue());
            System.out.println("breadthFirstSearch: " + heap2.breadthFirstSearch());
            heap2.enqueue(30);
            System.out.println("breadthFirstSearch: " + heap2.breadthFirstSearch());
            heap2.enqueue(0);
            System.out.println("breadthFirstSearch: " + heap2.breadthFirstSearch());
            heap2.enqueue(100);
            System.out.println("breadthFirstSearch: " + heap2.breadthFirstSearch());
            System.out.println("dequeue from heap2 : " +  heap2.dequeue());
            System.out.println("dequeue from heap2 : " +  heap2.dequeue());
            System.out.println("dequeue from heap2 : " +  heap2.dequeue());
            System.out.println("dequeue from heap2 : " +  heap2.dequeue());
            System.out.println("dequeue from heap2 : " +  heap2.dequeue());
            System.out.println("dequeue from heap2 : " +  heap2.dequeue());
            System.out.println("dequeue from heap2 : " +  heap2.dequeue());*/
	}
}