exercism 78 Binary Search Tree

Author: kumar91gopi

README.md

@@ -303,6 +303,7 @@ solution of many challenges of [Leetcode](https://leetcode.com/), [Exercism](htt
 75. [Crypto Square](https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/blob/master/exercism/crypto_square.rb)
 76. [List Ops](https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/blob/master/exercism/list_ops.rb)
 77. [Simple Linked List](https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/blob/master/exercism/simple_linked_list.rb)
+78. [Binary Search Tree](https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/blob/master/exercism/binary_search_tree.rb)
 
 <a name="leetcode"/>
 

exercism/binary_search_tree.rb

@@ -0,0 +1,57 @@
+# Problem: https://exercism.org/tracks/ruby/exercises/binary-search-tree
+
+# Solution
+class Bst
+    include Enumerable
+    NODE = Struct.new(:data,:left,:right)
+    
+    def initialize(value)
+      @root = NODE.new(value,nil,nil)
+    end
+
+    def data
+      @root.data
+    end
+    def left
+      @root.left
+    end
+    def right
+      @root.right
+    end
+
+    def insert(element)
+      current = @root
+      prev = @root
+      until current.nil?
+       if current.data>=element
+         prev = current
+         current = current.left
+       else
+         prev = current
+         current = current.right
+       end
+      end
+      current = NODE.new(element,nil,nil)
+      if prev.data >= element
+        prev.left = current
+      else
+        prev.right = current
+      end
+    end
+
+    def each(&block)
+      return to_enum(:each) unless block_given?
+      inorder_traversal(@root,[]).each do |val|
+        yield(val)
+      end
+    end
+
+    def inorder_traversal(node,arr)
+      unless node.nil?
+        inorder_traversal(node.left,arr)
+        arr.push(node.data)
+        inorder_traversal(node.right,arr)
+      end
+      arr
+    end
+end