Python one stack solution, without linklist
\nclass MinStack(object):\n    \n    def init(self):\n        """\n        initialize your data structure here.\n        """\n        self.stack= []\n\n    def 
\nclass MinStack(object):\n    \n    def __init__(self):\n        """\n        initialize your data structure here.\n        """\n        self.stack= []\n\n    def push(self, x):\n        """\n        :type x: int\n        :rtype: nothing\n        """\n        if not self.stack:self.stack.append((x,x)) \n        else:\n           self.stack.append((x,min(x,self.stack[-1][1])))\n\n    def pop(self):\n        """\n        :rtype: nothing\n        """\n        if self.stack: self.stack.pop()\n\n    def top(self):\n        """\n        :rtype: int\n        """\n        if self.stack: return self.stack[-1][0]\n        else: return None\n\n    def getMin(self):\n        """\n        :rtype: int\n        """\n        if self.stack: return self.stack[-1][1]\n        else: return None
['Python']