#insert

Author: bmulvihill

exercises/binary-search-tree/spec/binary_search_tree_spec.cr

@@ -7,34 +7,36 @@ describe "Node" do
     root.value.should eq(1)
   end
 
-  pending "inserts smaller values to the left" do
-    tree = Node(Int32).new(4)
-    tree.insert(2)
+  describe "#insert" do
+    pending "inserts smaller values to the left" do
+      tree = Node(Int32).new(4)
+      tree.insert(2)
 
-    left = tree.left.not_nil!
-    left.value.should eq(2)
+      left = tree.left.not_nil!
+      left.value.should eq(2)
 
-    tree.right.should be_nil
-  end
+      tree.right.should be_nil
+    end
 
-  pending "inserts equal values to the left" do
-    tree = Node(Int32).new(4)
-    tree.insert(4)
+    pending "inserts equal values to the left" do
+      tree = Node(Int32).new(4)
+      tree.insert(4)
 
-    left_node = tree.left.not_nil!
-    left_node.value.should eq(4)
+      left_node = tree.left.not_nil!
+      left_node.value.should eq(4)
 
-    tree.right.should be_nil
-  end
+      tree.right.should be_nil
+    end
 
-  pending "inserts greater values to the right" do
-    tree = Node(Int32).new(4)
-    tree.insert(5)
+    pending "inserts greater values to the right" do
+      tree = Node(Int32).new(4)
+      tree.insert(5)
 
-    right_node = tree.right.not_nil!
-    right_node.value.should eq(5)
+      right_node = tree.right.not_nil!
+      right_node.value.should eq(5)
 
-    tree.left.should be_nil
+      tree.left.should be_nil
+    end
   end
 
   describe "#search" do