ym_data_tree 0.1.1 → 1.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 498e3b6c92058c482c10dd23ffc8f38bfa241c08
-  data.tar.gz: fe32fd6ec527e9dfcb1b1525b2b89acf0cc11ad0
+  metadata.gz: b27163e53172ca6299947a4e9bce35fe32c26f5f
+  data.tar.gz: '001361842e0397f742ae8510f3131cb9a4b39e7c'
 SHA512:
-  metadata.gz: 8b3fb56aff5022b65aa523fefe2f1712989a44ead4d220bd200ab7812c86477dba883e9fed16914561f25598bd2999def62ba5fae5709dbf560062d36f3dd843
-  data.tar.gz: e49d8d47391e96e8958f406ea357e87206b8a3121be24bec56c058fa479a198af84a1e482288b0aebf9f2814d5bc4582ef67f727f7b2b621c6d7e918d37aff68
+  metadata.gz: e9e96bafb2390133921c8ff4ea186a82a6e80b2297205c8efb3eb7002aef4d2ef10d5655286f7456da29411c1186867d246fbf7e77561e98d693dcdc06268162
+  data.tar.gz: 7fad6ff5524be9f9303d6d3bea5bddd432acb92ac5ff32c9f1414f5eb3a26cee31ddbc62bc6f296507faf767228ae98c1f3bd6c1a8eb81fc034082eaa0b609ef

data/README.md

@@ -1,6 +1,5 @@
 # YmDataTree
 [![Coverage Status](https://coveralls.io/repos/github/ismetsezer/ym_data_tree/badge.svg)](https://coveralls.io/github/ismetsezer/ym_data_tree)
-
 [![Build Status](https://travis-ci.org/ismetsezer/ym_data_tree.svg?branch=master)](https://travis-ci.org/ismetsezer/ym_data_tree)
 ## Installation
 
@@ -10,14 +9,14 @@ gem 'ym_data_tree'
 
 And then execute:
 
-    $ bundle
+    $ bundle install
 
 Or install it yourself as:
 
     $ gem install ym_data_tree
 
 ## Usage
-*In Order Traversal Example*
+*In Order/ Post Order / Pre Order Traversal Example*
 ```ruby
   require 'ym_data_tree'
   tree = YmDataTree::Tree.new
@@ -26,13 +25,18 @@ Or install it yourself as:
     tree.insert(data)
   end
   #Then Traverse The Tree
-  tree.in_order_traversal(tree.root)
-  print in_order_traversal_datas = tree.getDatas
-
+  tree.traverse(tree.root,:in_order_traversal)
   #->[5,6,8,10,11,12,15]
+
+  tree.traverse(tree.root,:pre_order_traversal)
+  #->[10,6,5,8,12,11,15]
+
+  tree.traverse(tree.root,:post_order_traversal)
+
+  #->[5,8,6,11,15,12]
 ```
 
-*Pre Order Traversal Example*
+*Breadth First Traversal*
 ```ruby
 require 'ym_data_tree'
 tree = YmDataTree::Tree.new
@@ -40,12 +44,12 @@ datas =  [10,6,8,5,12,11,15]
 datas.each do |data|
   tree.insert(data)
 end
-tree.pre_order_traversal(tree.root)
-print pre_order_traversal_datas = tree.getDatas
 
-#-> [10,6,5,8,12,11,15]
+tree.traverse(tree.root,:breadth_first_traversal)
+#->[10,6,12,8,11,5,15]
+
 ```
-*Post Order Traversal Example*
+
 ```ruby
 require 'ym_data_tree'
 tree = YmDataTree::Tree.new
@@ -53,12 +57,17 @@ datas =  [10,6,8,5,12,11,15]
 datas.each do |data|
   tree.insert(data)
 end
-tree.post_order_traversal(tree.root)
-print post_order_traversal_datas = tree.getDatas
 
-#-> [5,8,6,11,15,12]
-```
+tree.traverse(tree.root,:deep_first_traversal,:pre_order_traversal)
+#->  [6, 5, 8, 10, 12, 11, 15]
+
+tree.traverse(tree.root,:deep_first_traversal,:in_order_traversal)
+ #-> [5, 6, 8, 10, 11, 12, 15]
 
+tree.traverse(tree.root,:deep_first_traversal,:post_order_traversal)
+
+#->[5, 8, 6, 10, 11, 15, 12]
+```
 
 
 ## Contributing

data/lib/ym_data_tree.rb

@@ -5,10 +5,13 @@ module YmDataTree
   class Tree
     def initialize
       @root = nil
-      @in_order_traversal_datas = @post_order_traversal_datas = @pre_order_traversal_datas = []
+      @in_order_traversal_datas = []
+      @post_order_traversal_datas = []
+      @pre_order_traversal_datas = []
     end
     attr_accessor :root
     def insert(data)
+
       @tempNode = Node.new
       @tempNode.data = data
       if @root == nil
@@ -35,35 +38,103 @@ module YmDataTree
         end
       end
     end
-    def in_order_traversal(node)
-        if node != nil
-         in_order_traversal(node.leftChild)
-          @in_order_traversal_datas.push(node.data)
-         in_order_traversal(node.rightChild)
-        end
+    def clear
+      @pre_order_traversal_datas = []
+      @in_order_traversal_datas = []
+      @post_order_traversal_datas = []
     end
-    def post_order_traversal(node)
-      if node != nil
-          post_order_traversal(node.leftChild)
-          post_order_traversal(node.rightChild)
-          @post_order_traversal_datas.push(node.data)
+    def traverse(node,*command)
+      clear
+      if command.first.eql? :pre_order_traversal
+        pre_order_traversal(node)
+      elsif command.first.eql? :in_order_traversal
+        in_order_traversal(node)
+      elsif command.first.eql? :post_order_traversal
+        post_order_traversal(node)
+      elsif command.first.eql? :breadth_first_traversal
+        breadth_first_traversal(node)
+      elsif command.first.eql? :deep_first_traversal
+        deep_first_traversal(self,command[1])
+      else
+        puts "Unknown Command"
       end
     end
-    def pre_order_traversal(node)
-       if node != nil
-         @pre_order_traversal_datas.push(node.data)
-         pre_order_traversal(node.leftChild)
-         pre_order_traversal(node.rightChild)
-       end
-    end
-    def getDatas
-      if @in_order_traversal_datas != nil
-        @in_order_traversal_datas
-      elsif @post_order_traversal_datas != nil
-        @pre_order_traversal_datas
-      elsif @pre_order_traversal_datas != nil
+
+    ##PRIVATE METHODS
+    private
+      def in_order_traversal(node)
+          if node != nil
+           in_order_traversal(node.leftChild)
+            @in_order_traversal_datas.push(node.data)
+           in_order_traversal(node.rightChild)
+          end
+          @in_order_traversal_datas
+      end
+      def post_order_traversal(node)
+        if node != nil
+            post_order_traversal(node.leftChild)
+            post_order_traversal(node.rightChild)
+            @post_order_traversal_datas.push(node.data)
+        end
         @post_order_traversal_datas
       end
-    end
+      def pre_order_traversal(node)
+         if node != nil
+           @pre_order_traversal_datas.push(node.data)
+           pre_order_traversal(node.leftChild)
+           pre_order_traversal(node.rightChild)
+         end
+         @pre_order_traversal_datas
+      end
+      def breadth_first_traversal(node)
+        if node != nil
+            @ordered = [node]
+            @quequ = []
+            @datas = [node.data]
+            count = 0
+          while count < 2
+            @ordered.each do |node|
+              if node != nil
+                if node.leftChild != nil
+                  @quequ.push(node.leftChild)
+                  @datas.push(node.leftChild.data)
+                end
+                if node.rightChild != nil
+                  @quequ.push(node.rightChild)
+                  @datas.push(node.rightChild.data)
+                end
+              end
+            end
+              @ordered = @quequ
+              count += 1
+            end
+            @datas
+          end
+      end
+      def deep_first_traversal(tree,command)
+          @datas = []
+          @datas_left = []
+          @datas_right = []
+          node = tree.root
+          if node != nil
+            @left = node.leftChild
+            @rigth = node.rightChild
+            if command.eql? :pre_order_traversal
+              @datas_left = tree.traverse(@left,command)
+              @datas_right = tree.traverse(@rigth,command)
+            elsif command.eql? :in_order_traversal
+              @datas_left = tree.traverse(@left,command)
+              @datas_right = tree.traverse(@rigth,command)
+            elsif command.eql? :post_order_traversal
+              @datas_left = tree.traverse(@left,command)
+              @datas_right = tree.traverse(@rigth,command)
+            end
+            @datas_left.each{|data|  @datas.push(data)}
+            @datas.push(node.data)
+            @datas_right.each{|data| @datas.push(data)}
+            @datas
+          end
+      end
+      #PRIVATE METHODS
   end
 end

data/lib/ym_data_tree/version.rb

@@ -1,3 +1,3 @@
 module YmDataTree
-  VERSION = "0.1.1"
+  VERSION = "1.1.2"
 end

data/ym_data_tree.gemspec

@@ -10,7 +10,7 @@ Gem::Specification.new do |spec|
   spec.email         = ["ismetsezer1996@gmail.com"]
 
   spec.summary       = %q{Ym-Data-Tree}
-  spec.description   = %q{This  gem useful for data structures}
+  spec.description   = %q{In Order Traversal , Pre Order Traversal , Post Order Traversal,Breadth First Traversal , Deep Search Traversal}
   spec.homepage      = "https://www.github.com/ismetsezer/ym_data_tree"
   spec.license       = "MIT"
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ym_data_tree
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 1.1.2
 platform: ruby
 authors:
 - Ismet Sezer Simsek
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2017-02-07 00:00:00.000000000 Z
+date: 2017-02-08 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -94,7 +94,8 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
-description: This  gem useful for data structures
+description: In Order Traversal , Pre Order Traversal , Post Order Traversal,Breadth
+  First Traversal , Deep Search Traversal
 email:
 - ismetsezer1996@gmail.com
 executables: []