GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — algorithm/recursion/ReverseAStackUsingRecursion.py at python · itsvinayak/algorithm Expand file tree/ Copy pathReverseAStackUsingRecursion.pyMore file actions 46 lines (35 loc) · 920 Bytes / Copy pathReverseAStackUsingRecursion.pyFile metadata and controls46 lines (35 loc) · 920 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 class Stack: def __init__(self): self.stack = [] def push(self, element): self.stack.append(element) def pop(self): return self.stack.pop() def top(self): return self.stack[-1] def isEmpty(self): return len(self.stack) == 0 def insertElementEnd(self, element): if self.isEmpty(): self.push(element) else: temp = self.pop() self.insertElementEnd(element) self.push(temp) def reverse(self): if not self.isEmpty(): temp = self.pop() self.reverse() self.insertElementEnd(temp) def printStack(self): print(self.stack) def main(): s = Stack() s.push(1) s.push(2) s.push(3) s.printStack() s.reverse() s.printStack() if __name__ == "__main__": main() |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |