public void push(int d)
{
Node t = new Node(d);
t.next = top;
top = t;
}
public int? pop()
{
if (top != null)
{
Node item = top;
top = top.next;
return item.data;
}
return null;
}
