Updated Readme

prakhar1989 · prakhar1989 · commit 2c20abb5b54d · 2013-12-25T06:50:38.000+03:00
diff --git a/README.md b/README.md
@@ -33,6 +33,10 @@ Completed
 - Kandane's Algorithm
 - Knapsack Problem (0/1 and unbounded)
 - Prefix Tries
+- Stack ADT (with example problems)
+  - String Reverse
+  - Parenthesis Matching
+  - Infix to Postfix
 
 
 Tests
diff --git a/linear_datastructures/stack-adt.py b/linear_datastructures/stack-adt.py
@@ -41,7 +41,6 @@ def match_paren(parens):
                 return False
     return stack.isEmpty()
 
-
 def infix_to_postfix(infixexpr):
     prec = { '+': 2, '-': 2, '*': 3, '/': 3,'(': 1 } # denoting precedence
     operator_stack = Stack()
