static void Main(string[] args)
{
var ht = new HashTable <int, int>();
var ll = new MyLinkedList <int>();
var stackLL = new StackLL <int>();
var stackArr = new StackArray <int>();
var queueArr = new QueueArr <int>();
}
static void Main(string[] args)
{
var ht = new HashTable<int, int>();
var ll = new MyLinkedList<int>();
var stackLL = new StackLL<int>();
var stackArr = new StackArray<int>();
var queueArr = new QueueArr<int>();
}
internal GameObject visual; //Visual in-game representation of the vertex
/* Parameterized constructor for a vertex */
internal Vertex(string _name, string _country, string[] _misc)
{
name = _name;
country = _country;
misc = _misc;
clueCache = new StackLL();
edgesFoundHT = new HashTable(7);
clueString = "Clues about acquaintances:";
}
public static void Main(string[] args)
{
StackLL s = new StackLL();
s.Push(1);
s.Push(2);
s.Push(3);
s.Print();
Console.WriteLine(s.Pop());
s.Print();
}
public static void reverseStack <T>(StackLL <T> stk, T elementToInsert)
{
if (stk.noOfElements == 0)
{
return;
}
T topObj = stk.Top();
stk.Pop();
reverseStack(stk);
insertAtbottom(stk, topObj);
}
public static void insertAtBottom <T>(StackLL <T> stk, T element)
{
if (stk.noOfElements == 0)
{
stk.Push(elementToInsert);
return;
}
T topObj = stk.Top();
stk.Pop();
insertAtbottom(stk, element);
stk.push(topObj);
}
static void Main(string[] args)
{
StackLL<string> sll = new StackLL<string>();
string line = "to be or not to be";
string[] tokens = line.Split(' ');
foreach (var item in tokens)
{
sll.push(item);
}
//while (!sll.isEmpty())
//{
// Console.WriteLine(sll.pop());
//}
foreach (var item in sll)
{
Console.WriteLine(item);
}
}
