ds_algo 0.0.4 → 0.0.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: e3c1d14669980be5c2cd68fe505c7b3aa8f3e4b8e300bb3ec8d428adaa631529
-  data.tar.gz: 805e016b98d8266edc71b45e4c0d143fbdda494d4df49595cd357d94be391968
+  metadata.gz: 6fc3ae32de8f716602291fada0719eea3e9e23b7b4aadca52492b6a8ce7d4a43
+  data.tar.gz: 519a96cd24fe9c8ca97898675b5d2692d7ec0eb574ce24f43da6f632173fbecd
 SHA512:
-  metadata.gz: c4a9064e64336177c063051a46abf14a170f12a066d354ad20f03b9b4bcb2b237439a5261390bd47c683f37a06b098d69b28017f19004dfa26cbf0d0bb58e6da
-  data.tar.gz: 4b77c762d047d4505bfa6f8c0bfd79518d1dfded2a74484df8daaaef781ec0b275a980dd76cc16333a62f2afdfa6e3d4f6d97ac0d79fd097ae8adc106ea09ba4
+  metadata.gz: 15bb60332a8a4de4ce20ebc5a0aca6bafa881ea12cb65ac9e3dca20de4e87fbae927ca67293a2640099a5b3152e7dc48df8823dd16e92847c411f3c2f19ebb97
+  data.tar.gz: 15350ac6d7971f5775326ea41db49c57496ff86f732fc6c6d323574bdc98a1cbb8a7bb152c3fcd2a7108fd87c83d0b77c2c36f3994a84f32937b5afcc5c9dd4a

data/lib/data_struct/linked_list.rb

@@ -2,7 +2,9 @@
 
 # lib/data_struct/linked_list.rb
 
+# This module consists of all nodes and implementation of linked list
 module LinkedList
+  # This node for Singly Linked list implementation.
   class SinglyNode
     attr_accessor :data, :next_val
     def initialize(data, next_val = nil)
@@ -10,7 +12,7 @@ module LinkedList
       @next_val = next_val
     end
   end
-
+  # This node for Doubly Linked list implementation.
   class DoublyNode
     attr_accessor :data, :next_val, :pre_val
     def initialize(data, pre_val = nil, next_val = nil)
@@ -19,7 +21,7 @@ module LinkedList
       @pre_val = pre_val
     end
   end
-
+  # This is a singly linked list implementation.
   class Singly
     attr_reader :head, :length
     def initialize
@@ -118,7 +120,7 @@ module LinkedList
       @length -= 1
     end
   end
-
+  # This is a Doubly linked list implementation.
   class Doubly
     attr_reader :head, :length
     def initialize

data/lib/data_struct/queue.rb

@@ -1,5 +1,6 @@
 # frozen_string_literal: true
 
+# This is a implementation of Queue using an array
 class Queue
   attr_reader :length
   def initialize

data/lib/data_struct/stack.rb

@@ -1,5 +1,6 @@
 # frozen_string_literal: true
 
+# This is a implementation of stack using array
 class Stack
   attr_reader :length
   def initialize

data/lib/data_struct/tree.rb

@@ -0,0 +1,96 @@
+# frozen_string_literal: true
+
+# Tree moudle consists of different implementation of tree in different nodes
+module Tree
+  # This node primarily for binary tree and binary search tree
+  class BinaryNode
+    attr_accessor :data, :left, :right
+    def initialize(data, left = nil, right = nil)
+      @data = data
+      @left = left
+      @right = right
+    end
+  end
+  # This node is general purpose multi child node
+  class NormalNode
+    attr_accessor :data, :left, :right
+    def initialize(data, left = [], right = [])
+      @data = data
+      @left = left
+      @right = right
+    end
+  end
+  # This is implementation Binary search tree using Tree::BinaryNode
+  class BST
+    attr_reader :length
+    def initialize
+      @root = nil
+      @length, @height = 0
+      @state_arr = []
+    end
+
+    def insert val
+      in_length
+      @root = recur_insert @root, val
+    end
+    def find val
+      recur_search @root, val
+    end
+    def to_a
+      @state_arr = []
+      recur_pre_order(@root)
+      @state_arr
+    end
+    def empty? 
+      @length.zero?
+    end
+    def height?
+      recur_max_depth @root
+    end
+    private
+    def recur_insert node, val
+      return BinaryNode.new(val) if node.nil? 
+      if val < node.data
+        node.left = recur_insert(node.left, val)
+      elsif val > node.data
+        node.right = recur_insert(node.right, val)
+      end
+      node
+    end
+
+    def recur_search node, val
+      if node.nil? || node.data == val
+        return node
+      end
+      if node.data < val
+        return recur_search(node.right, val)
+      end
+      recur_search(node.left, val)
+    end
+
+    def recur_pre_order node
+      return if node.nil?
+      @state_arr << node.data
+      recur_pre_order(node.left) 
+      recur_pre_order(node.right)
+    end
+    def recur_max_depth node
+      return 0 if node.nil?
+      left_depth = recur_max_depth(node.left)
+      right_depth = recur_max_depth(node.right)
+
+      if left_depth > right_depth
+        return left_depth + 1
+      else
+        return right_depth + 1
+      end
+    end
+    def in_length
+      @length += 1
+    end
+  
+    def de_length
+      @length -= 1
+    end
+  end
+end

data/lib/ds_algo.rb

@@ -1,6 +1,9 @@
 # frozen_string_literal: true
 
+# This is class used to learn about algo and ds
 class DsAlgo
+  # #ds-eff? => nil
+  # used to know the efficiency of the data structure, its a table in a terminal
   def ds_eff?
     puts '+-----------------------------------------------------------------------------------+'
     puts '|                          Efficency table for DsAlgo                               |'

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ds_algo
 version: !ruby/object:Gem::Version
-  version: 0.0.4
+  version: 0.0.5
 platform: ruby
 authors:
 - imhtapm
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2019-07-27 00:00:00.000000000 Z
+date: 2019-07-28 00:00:00.000000000 Z
 dependencies: []
 description: collection of data structures and algorithms for learning and to build
   (under development)
@@ -20,11 +20,13 @@ files:
 - lib/data_struct/linked_list.rb
 - lib/data_struct/queue.rb
 - lib/data_struct/stack.rb
+- lib/data_struct/tree.rb
 - lib/ds_algo.rb
 homepage: https://rubygems.org/gems/ds_algo
 licenses:
 - MIT
-metadata: {}
+metadata:
+  source_code_uri: https://github.com/imhtapm/ds_algo
 post_install_message: 
 rdoc_options: []
 require_paths: