ds_algo 0.0.5 → 0.0.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 6fc3ae32de8f716602291fada0719eea3e9e23b7b4aadca52492b6a8ce7d4a43
-  data.tar.gz: 519a96cd24fe9c8ca97898675b5d2692d7ec0eb574ce24f43da6f632173fbecd
+  metadata.gz: 3142017407f40cacf010031a1ca79567ea97210c70c8476a0900827323f82dd5
+  data.tar.gz: 959bd8eb3d29fc76d305e558f5459c77a0ca0ca6beb730dfc11d7cf6f3438763
 SHA512:
-  metadata.gz: 15bb60332a8a4de4ce20ebc5a0aca6bafa881ea12cb65ac9e3dca20de4e87fbae927ca67293a2640099a5b3152e7dc48df8823dd16e92847c411f3c2f19ebb97
-  data.tar.gz: 15350ac6d7971f5775326ea41db49c57496ff86f732fc6c6d323574bdc98a1cbb8a7bb152c3fcd2a7108fd87c83d0b77c2c36f3994a84f32937b5afcc5c9dd4a
+  metadata.gz: 25d117c0ec37ceeece5abd411d5e8e9a4cac80c50f86cadddafa7655ca8725d6aef9d948892fec0195e86ca1510f1224a4b547a6bf238adef2ad05beb610d49e
+  data.tar.gz: 8d43871a0dd72738c9e9f1f0bc1b698f4a040bc252753992de2f072599574c9d31fd701e50120a518493ddbb230bb309d7ca1fd009966b3166396ed52152f636

data/lib/data_struct/linked_list.rb

@@ -29,7 +29,7 @@ module LinkedList
       @length = 0
     end
 
-    def shift(val)
+    def unshift(val)
       in_length
       @head = SinglyNode.new val, @head
     end
@@ -128,7 +128,7 @@ module LinkedList
       @length = 0
     end
 
-    def shift(val)
+    def unshift(val)
       in_length
       return @head = DoublyNode.new(val) if @head.nil?
 

data/lib/data_struct/queue.rb

@@ -19,11 +19,11 @@ class Queue
   end
 
   def front
-    @queue[0]
+    @queue.first
   end
 
   def last
-    @queue[-1]
+    @queue.last
   end
 
   def empty?

data/lib/data_struct/stack.rb

@@ -19,7 +19,7 @@ class Stack
   end
 
   def top
-    @stack[-1]
+    @stack.last
   end
 
   def empty?

data/lib/data_struct/tree.rb

@@ -33,13 +33,49 @@ module Tree
       in_length
       @root = recur_insert @root, val
     end
+    def min(node = @root)
+      cur = node
+      unless node.left.nil?
+        cur = cur.left
+      end
+      cur
+    end
+    def max(node = @root)
+      cur = node
+      unless node.right.nil?
+        cur = cur.right
+      end
+      cur
+    end
+    def delete(key, node = @root)
+      return @root = node if node.nil?
+
+      if key < node.data 
+        node.left = delete(key, node.left)
+      elsif key > node.data 
+        node.right = delete(key, node.right)
+      else
+        if node.left.nil?
+          temp = node.right
+          node = nil
+          return temp
+        elsif node.right.nil?
+          temp = node.left
+          node = nil
+          return temp
+        end
+
+        temp = min(node.right)
+        node.data = temp.data
+        node.right = delete(temp.data, node.right)
+      end
+      @root = node
+    end
     def find val
       recur_search @root, val
     end
     def to_a
-      @state_arr = []
-      recur_pre_order(@root)
-      @state_arr
+      recur_pre_order @root, []
     end
     def empty? 
       @length.zero?
@@ -47,6 +83,7 @@ module Tree
     def height?
       recur_max_depth @root
     end
+
     private
     def recur_insert node, val
       return BinaryNode.new(val) if node.nil? 
@@ -66,13 +103,15 @@ module Tree
         return recur_search(node.right, val)
       end
       recur_search(node.left, val)
+
     end
 
-    def recur_pre_order node
+    def recur_pre_order node, state
       return if node.nil?
-      @state_arr << node.data
-      recur_pre_order(node.left) 
-      recur_pre_order(node.right)
+      state << node.data
+      recur_pre_order(node.left, state) 
+      recur_pre_order(node.right, state)
+      state
     end
     def recur_max_depth node
       return 0 if node.nil?

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ds_algo
 version: !ruby/object:Gem::Version
-  version: 0.0.5
+  version: 0.0.6
 platform: ruby
 authors:
 - imhtapm
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2019-07-28 00:00:00.000000000 Z
+date: 2019-08-15 00:00:00.000000000 Z
 dependencies: []
 description: collection of data structures and algorithms for learning and to build
   (under development)
@@ -42,7 +42,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.4
+rubygems_version: 3.0.3
 signing_key: 
 specification_version: 4
 summary: ruby gem for data structures and algorithms (under development)