private static void MaxBinaryHeapDemo()
{
int[] initialHeap = new int[] { 41, 39, 33, 18, 27, 12 };
int newItem = 45;
MaxBinaryHeap h = new MaxBinaryHeap(initialHeap);
Console.WriteLine("Heap before add: ");
h.PrintHeap();
// Add
h.Add(newItem);
Console.WriteLine($"Heap after adding {newItem}: ");
h.PrintHeap();
// Remove
int?maxValue = null;
do
{
maxValue = h.ExtractMax();
Console.WriteLine($"Heap after getting max {maxValue}: ");
h.PrintHeap();
} while (maxValue.HasValue);
}
static void Main(string[] args)
{
#region " Singly Linked List "
Console.WriteLine("============= Singly Linked List =============");
SinglyLinkedList <int> ls = new SinglyLinkedList <int>();
ls.Push(0);
ls.Push(1);
ls.Push(2);
ls.Push(3);
Console.Write("Singly linked List: ");
ls.Print();
Console.Write("Singly linked List Reversed: ");
ls.Reverse();
ls.Print();
Console.WriteLine($"Popped Value: {ls.Pop().Value}");
Console.WriteLine($"Popped Value: {ls.Pop().Value}");
Console.WriteLine($"Popped Value: {ls.Pop().Value}");
Console.WriteLine($"Popped Value: {ls.Pop().Value}");
ls.Print();
#endregion
#region " Stack "
Console.WriteLine("============= Stack =============");
Stack <int> stack = new Stack <int>();
stack.Push(1);
stack.Push(2);
stack.Push(3);
stack.Push(4);
Console.WriteLine($"Number of elements in Stack is {stack.Count}");
Console.WriteLine(stack.Pop().Value);
Console.WriteLine(stack.Pop().Value);
Console.WriteLine(stack.Pop().Value);
Console.WriteLine(stack.Pop().Value);
Console.WriteLine($"Number of elements in Stack is {stack.Count}");
#endregion
#region " Queue "
Console.WriteLine("============= Queue =============");
Queue <int> data = new Queue <int>();
data.Enqueue(1);
data.Enqueue(2);
data.Enqueue(3);
data.Enqueue(4);
Console.WriteLine($"Number of elements in Queue is {data.Count}");
Console.WriteLine(data.Dequeue().Value);
Console.WriteLine(data.Dequeue().Value);
Console.WriteLine(data.Dequeue().Value);
Console.WriteLine(data.Dequeue().Value);
Console.WriteLine($"Number of elements in Queue is {data.Count}");
#endregion
#region " Binary Search Tree "
Console.WriteLine("============= Binary Search Tree =============");
/*
* 10
* / \
* 6 15
* / \ / \
* 3 8 11 20
* /
* 0
*/
BinarySearchTree myBST = new BinarySearchTree();
myBST.AddToTree(10);
myBST.AddToTree(6);
myBST.AddToTree(15);
myBST.AddToTree(3);
myBST.AddToTree(8);
myBST.AddToTree(11);
myBST.AddToTree(20);
myBST.AddToTree(0);
Console.WriteLine($"BFS Traversal Data: ");
PrintList(myBST.BFS()); // 10,6,15,3,8,11,20,0
Console.WriteLine($"DFS-PreOrder Traversal Data: ");
PrintList(myBST.DFS_PreOrder_Iterative()); // 10,6,3,0,8,15,11,20
PrintList(myBST.DFS_PreOrder_Recursive());
Console.WriteLine($"DFS-InOrder Traversal Data: ");
PrintList(myBST.DFS_InOrder_Iterative()); // 0,3,6,8,10,11,15,20
PrintList(myBST.DFS_InOrder_Recursive());
Console.WriteLine($"DFS-PostOrder Traversal Data: ");
PrintList(myBST.DFS_PostOrder_Iterative()); // 0,3,8,6,11,20,15,10
PrintList(myBST.DFS_PostOrder_Recursive());
#endregion
#region " Max Binary Heap "
Console.WriteLine("============= Max Binary Heap =============");
MaxBinaryHeap maxHeap = new MaxBinaryHeap();
maxHeap.Insert(18);
maxHeap.Insert(27);
maxHeap.Insert(12);
maxHeap.Insert(39);
maxHeap.Insert(33);
maxHeap.Insert(41);
PrintList(maxHeap.Values);
Console.WriteLine(maxHeap.ExtractMax());
Console.WriteLine(maxHeap.ExtractMax());
Console.WriteLine(maxHeap.ExtractMax());
Console.WriteLine(maxHeap.ExtractMax());
Console.WriteLine(maxHeap.ExtractMax());
Console.WriteLine(maxHeap.ExtractMax());
#endregion
#region " Min Binary Heap "
Console.WriteLine("============= Min Binary Heap =============");
MinBinaryHeap minHeap = new MinBinaryHeap();
minHeap.Insert(18);
minHeap.Insert(27);
minHeap.Insert(12);
minHeap.Insert(39);
minHeap.Insert(33);
minHeap.Insert(41);
PrintList(minHeap.Values);
Console.WriteLine(minHeap.ExtractMin());
Console.WriteLine(minHeap.ExtractMin());
Console.WriteLine(minHeap.ExtractMin());
Console.WriteLine(minHeap.ExtractMin());
Console.WriteLine(minHeap.ExtractMin());
Console.WriteLine(minHeap.ExtractMin());
#endregion
#region " Priority Queue "
Console.WriteLine("============= Priority Queue =============");
PriorityQueue queue = new PriorityQueue();
queue.Enqueue("common cold", 1);
queue.Enqueue("knife stab", 5);
queue.Enqueue("high fever", 3);
queue.Enqueue("dislocated arm", 4);
queue.Enqueue("flu", 2);
Console.WriteLine(queue.Dequeue().Value);
Console.WriteLine(queue.Dequeue().Value);
Console.WriteLine(queue.Dequeue().Value);
Console.WriteLine(queue.Dequeue().Value);
Console.WriteLine(queue.Dequeue().Value);
#endregion
#region " Graphs "
Console.WriteLine("============= Graphs =============");
// Undirected Graph
/**
* Chicago
* | \
* | \
* Dallas Atlanta
* | \
* | \
* San Francisco----Orlando
* \ /
* \ /
* Las Vegas
* **/
var udGraph = new Graph();
udGraph.AddVertex("Chicago");
udGraph.AddVertex("Dallas");
udGraph.AddVertex("Atlanta");
udGraph.AddVertex("San Francisco");
udGraph.AddVertex("Orlando");
udGraph.AddVertex("Las Vegas");
udGraph.AddAnEdge("Chicago", "Dallas");
udGraph.AddAnEdge("Chicago", "Atlanta");
udGraph.AddAnEdge("Dallas", "San Francisco");
udGraph.AddAnEdge("Atlanta", "Orlando");
udGraph.AddAnEdge("San Francisco", "Orlando");
udGraph.AddAnEdge("San Francisco", "Las Vegas");
udGraph.AddAnEdge("Orlando", "Las Vegas");
PrintList(udGraph.DFSRecursive("Chicago"));
PrintList(udGraph.DFSIterative("Chicago"));
PrintList(udGraph.BFSTraversal("Chicago"));
#endregion
#region " Topological Sort "
Console.WriteLine("============= Topological Sort =============");
TopologicalSort tSorter = new TopologicalSort();
var adjList = new System.Collections.Generic.Dictionary <string, string[]>();
adjList.Add("A", new string[] { "B", "C" });
adjList.Add("B", new string[] { "D", "C" });
adjList.Add("C", new string[] { "E" });
adjList.Add("D", new string[] { "E", "F" });
adjList.Add("G", new string[] { "E", "F" });
bool hasCycle = tSorter.IsThereALoop(adjList);
Console.WriteLine($"Given Graph has a cycle? {hasCycle}");
if (!hasCycle)
{
Console.WriteLine($"Topological Order for the give graph: ");
PrintList(tSorter.FindTopologicalSort(adjList));
}
adjList = new System.Collections.Generic.Dictionary <string, string[]>();
adjList.Add("A", new string[] { "B", "C" });
adjList.Add("B", new string[] { "D", "C" });
adjList.Add("C", new string[] { "E", "A" });
adjList.Add("D", new string[] { "E", "F" });
adjList.Add("G", new string[] { "E", "F" });
hasCycle = tSorter.IsThereALoop(adjList);
Console.WriteLine($"Given Graph has a cycle? {hasCycle}");
if (!hasCycle)
{
Console.WriteLine($"Topological Order for the give graph: ");
PrintList(tSorter.FindTopologicalSort(adjList));
}
#endregion
Console.ReadLine();
}