Update BinarySearchTree.rb

Author: sgoldens

BinarySearchTree.rb

@@ -1,138 +1,7 @@
-# File: BinarySearchTree.rb
-#
-# Author: Sasha Goldenson
-#
-# License: Free to use
-#
-# Inspiration: Ron Tsui's (https://github.com/vokoshyv) excellent technical guidance has been very helpful in my understanding of these fundamentals.
-#
-# Motivation: Continuing my education, solidifying my fundamentals. Spreading the love.
-#
-# Test-Driven Development: Developed using 10 unit tests with a total of 31 assertions which describe and document this Binary Search Tree.
-#
-# Binary Search Trees are a special pattern of the Tree pattern. They must follow the algorithmic rules which say the left child of the parent is always
-# lesser and the right child is always greater than its parent. If there is already a child in the direction you must move while traversing the tree, you
-# repeat the same rules until an avaialble space is found. 
-#
-# Because BSTs are sorted in this fashion, operations of insertion, searching, and deleting is done faster than the linear time operations done on an 
-# unsorted tree. Binary insert, search, and delete are completed in O(log n), "Logarmithmic" time, which is the fastest there is behind O(1), 
-# "Constant time".
-#
-##########
-# Unit Tests
-##########
-
-require "test/unit"
-
-class NodeClassTest < Test::Unit::TestCase
-
-  def test_node_can_be_created
-    test = Node.new
-
-    assert_not_equal(nil, test)
-    assert_equal(nil, test.value)
-  end
-
-  def test_node_can_hold_value
-    test = Node.new(5)
-
-    assert_equal(5, test.value)
-    assert_equal(nil, test.left_child)
-    assert_equal(nil, test.right_child)
-  end
-
-  def test_node_can_point_to_other_nodes_through_children
-    test = Node.new(14)
-    test_left = Node.new(20)
-    test_right = Node.new(9422)
-    test.left_child = test_left
-    test.right_child = test_right
-
-    assert_equal(test.left_child.value, test_left.value)
-    assert_equal(test.right_child.value, test_right.value)
-  end
-
-end
-
-class BinarySearchTreeTest < Test::Unit::TestCase
-
-  def test_binary_search_can_be_created
-    test = BinarySearchTree.new
-
-    assert_not_equal(nil, test)
-  end
-
-  def test_binary_search_tree_properties_exist
-    test = BinarySearchTree.new
-
-    assert_respond_to(test, :root)
-    assert_respond_to(test, :size)
-  end
-
-  def test_binary_search_tree_methods_exist
-    test = BinarySearchTree.new
-
-    assert_respond_to(test, :insert)
-    assert_respond_to(test, :search)
-    assert_respond_to(test, :remove)
-  end
-
-  def test_binary_search_tree_insert_children
-    test = BinarySearchTree.new
-    test.insert(7)
-    test.insert(20)
-    test.insert(4)
-
-    assert_equal(7, test.root.value)
-    assert_equal(4, test.root.left_child.value)
-    assert_equal(20, test.root.right_child.value)
-    assert_equal(nil, test.root.right_child.right_child)
-    assert_equal(nil, test.root.right_child.left_child)
-    assert_equal(nil, test.root.left_child.right_child)
-    assert_equal(nil, test.root.left_child.left_child)
-    assert_equal(3, test.size)
-  end
-
-  def test_binary_search_tree_search_method_node_exists
-    test = BinarySearchTree.new
-    values = [4,9,141,48,7]
-    values.each { |val| test.insert(val) }
-
-    assert_equal(true, test.search(48))
-  end
-
-  def test_binary_search_tree_search_method_node_does_not_exist
-    test = BinarySearchTree.new
-    values = [4,9,141,48,7]
-    values.each { |val| test.insert(val) }
-
-    assert_equal(false, test.search(8))
-  end
-
-
-  def test_binary_search_tree_remove_method_deletes_value
-    test = BinarySearchTree.new()
-    values = [4,9,141,48,7]
-
-    values.each { |val| test.insert(val) }
-
-    assert_equal(5, test.size)
-    assert_equal(true, test.search(4))
-    assert_equal(true, test.search(141))
-    assert_equal(true, test.search(9))
-
-    test.remove(4)
-    assert_equal(4, test.size)
-    assert_equal(false, test.search(4))
-    assert_equal(true, test.search(7))
-    assert_equal(true, test.search(141))
-  end
-
-end
-
 #####################
 # Node class
 #####################
+
 class Node
 
   attr_accessor :value, :left_child, :right_child
@@ -241,3 +110,115 @@ def method_missing(name, *args, &block)
     @self.send(name, *args, &block)
   end
 end
+
+############
+# Unit Tests
+############
+
+require "test/unit"
+
+class NodeClassTest < Test::Unit::TestCase
+
+  def test_node_can_be_created
+    test = Node.new
+
+    assert_not_equal(nil, test)
+    assert_equal(nil, test.value)
+  end
+
+  def test_node_can_hold_value
+    test = Node.new(5)
+
+    assert_equal(5, test.value)
+    assert_equal(nil, test.left_child)
+    assert_equal(nil, test.right_child)
+  end
+
+  def test_node_can_point_to_other_nodes_through_children
+    test = Node.new(14)
+    test_left = Node.new(20)
+    test_right = Node.new(9422)
+    test.left_child = test_left
+    test.right_child = test_right
+
+    assert_equal(test.left_child.value, test_left.value)
+    assert_equal(test.right_child.value, test_right.value)
+  end
+
+end
+
+class BinarySearchTreeTest < Test::Unit::TestCase
+
+  def test_binary_search_can_be_created
+    test = BinarySearchTree.new
+
+    assert_not_equal(nil, test)
+  end
+
+  def test_binary_search_tree_properties_exist
+    test = BinarySearchTree.new
+
+    assert_respond_to(test, :root)
+    assert_respond_to(test, :size)
+  end
+
+  def test_binary_search_tree_methods_exist
+    test = BinarySearchTree.new
+
+    assert_respond_to(test, :insert)
+    assert_respond_to(test, :search)
+    assert_respond_to(test, :remove)
+  end
+
+  def test_binary_search_tree_insert_children
+    test = BinarySearchTree.new
+    test.insert(7)
+    test.insert(20)
+    test.insert(4)
+
+    assert_equal(7, test.root.value)
+    assert_equal(4, test.root.left_child.value)
+    assert_equal(20, test.root.right_child.value)
+    assert_equal(nil, test.root.right_child.right_child)
+    assert_equal(nil, test.root.right_child.left_child)
+    assert_equal(nil, test.root.left_child.right_child)
+    assert_equal(nil, test.root.left_child.left_child)
+    assert_equal(3, test.size)
+  end
+
+  def test_binary_search_tree_search_method_node_exists
+    test = BinarySearchTree.new
+    values = [4,9,141,48,7]
+    values.each { |val| test.insert(val) }
+
+    assert_equal(true, test.search(48))
+  end
+
+  def test_binary_search_tree_search_method_node_does_not_exist
+    test = BinarySearchTree.new
+    values = [4,9,141,48,7]
+    values.each { |val| test.insert(val) }
+
+    assert_equal(false, test.search(8))
+  end
+
+
+  def test_binary_search_tree_remove_method_deletes_value
+    test = BinarySearchTree.new()
+    values = [4,9,141,48,7]
+
+    values.each { |val| test.insert(val) }
+
+    assert_equal(5, test.size)
+    assert_equal(true, test.search(4))
+    assert_equal(true, test.search(141))
+    assert_equal(true, test.search(9))
+
+    test.remove(4)
+    assert_equal(4, test.size)
+    assert_equal(false, test.search(4))
+    assert_equal(true, test.search(7))
+    assert_equal(true, test.search(141))
+  end
+
+end