diff --git a/lib/containers/stack.rb b/lib/containers/stack.rb
index 3d886ab4..e89dbf43 100644
--- a/lib/containers/stack.rb
+++ b/lib/containers/stack.rb
@@ -6,7 +6,7 @@
     This implementation uses a doubly-linked list, guaranteeing O(1) complexity for all operations.
 
 =end
-  class Containers::Stack
+class Containers::Stack
   include Enumerable
   # Create a new stack. Takes an optional array argument to initialize the stack.
   #
diff --git a/lib/containers/trie.rb b/lib/containers/trie.rb
index 2d681880..26f0fb16 100644
--- a/lib/containers/trie.rb
+++ b/lib/containers/trie.rb
@@ -8,8 +8,7 @@
 
     This implemention is based on a Ternary Search Tree.
 =end
-  class Containers::Trie
-  
+class Containers::Trie  
   # Create a new, empty Trie.
   #
   #   t = Containers::Trie.new