static void Main(string[] args)
{
// Arrays and Strings Tests
ArraysAndStrings aas = new ArraysAndStrings();
// 1.1
aas.uniqueCharsTest();
// 1.2
aas.isPermutationTest();
// 1.3
aas.URLifyTest();
// 1.4
aas.isPalPermTest();
// Linked Lists Tests
SinglyLinkedList list = new SinglyLinkedList();
// 2.1
list.removeDuplicatesTest();
// 2.2
list.kthFromTailTest();
// 2.3
// Stacks & Queues
MyStack stack = new MyStack();
// 3.2
stack.minTest();
// 3.3
SetOfStacks stacks = new SetOfStacks();
stacks.popAtTest();
// Trees & Graphs
Tree t = Tree.generateTestTree();
// BFT
t.bft();
t.inOrder(t.root);
t.preOrder(t.root);
t.postOrder(t.root);
//4.8
Tree.postOrderTraversalTest();
}
public int findMin()
{
int min = peek();
MyStack tempStack = new MyStack();
// pop everything off the stack into another stack
while (top != null)
{
if (peek() < min)
{
min = peek();
}
tempStack.push(pop());
}
// return the items to the stack
while (tempStack.top != null)
{
this.push(tempStack.pop());
}
return(min);
}