lStack | Python Fiddle

#doirej;oafe

class Node:

def __init__(self, item):
        self.item = item
        self.next = None
                 
            
class Stack:

def __init__(self):
    	self.top = None
    	self.size = 0
    
	def isEmpty(self):
        return self_top is None
        
    def __len__(self):
        return self.size
        
   	def peek (self):
        assert not self.isEmpty(), "Cannot peek at an empty stack"
       	return self.top.item
        
    def pop(self):
        assert not self.isEmpty(), "Cannot pop from an empty stack"
        if self.size >= 2:
            newNode = self.top 
            self.curNode = self.curNode.next
        	self.curNode.prev = None
       		self.top = self.curNode
        else:
            newNode = self.top
            self.top = None
        
        return newNode.item
    	self.size -=1

def push(self,item):
        newNode = Node(item)
        
        if self.top is None:
            self.top = newNode
            self.curNode = newNode
            self.curNode.next = None
        
        else:
            newNode.next = self.top
            self.top=newNode
            self.curNode=self.top

self.size += 1

def PrintList(self):
    	while not self.isEmpty():
        	print(self.top.item)
        	self.top.pop()

x = Stack()
x.push(5)
x.push(6)
x.push(3)
x.push(9)

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE