binary_tree 1.0.0 → 1.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 0a73fe5ef37eeaa90d7c7efff8c1c0d4663f6e9daf07637ba692565c29884d96
-  data.tar.gz: cf740fedf52fb09de5a892c91e8ed041853173d4920993fdd3760d61ca124ddb
+  metadata.gz: e5384a303df8f020e5d485035b1a573ac5f0d842abe2f43da3e34ff20977ab9a
+  data.tar.gz: 392f293f44752192f3b30b63c1c38b06ffde5bdf2e9575d6c69e9e6b163fab9a
 SHA512:
-  metadata.gz: de486b01b6696c1bf78efccc4b63fc2017ff71afd54b9b178d5e0cf791e6d3902e10e264730bbf566e221cff8d91ca7b14270c6cdebac5a50387495faae4f27b
-  data.tar.gz: 527d264a819c51f6d5cb8f1bbd7d685aba90e172c264ad41232d2925013a4db1a9e4d7827ca33715de757276a81b5bd46eabe61aed63e82d21bff623e67a2843
+  metadata.gz: 11a535d640b5318ff14a550766fc4ecf6f3ad9c41eb6227eea7023ffc7f722604572cfbb3931ba0a42f14f9841d6cf7249f3d3961666bcb44d9784d7e68cdfb7
+  data.tar.gz: b5e223db5b68ca242e472bc74767f71951373a6e8316cb4c4892e738e49c53c42046bd14307f5ee7c41c70a0df0bac0b0a364d0e48b9af2f0c52df5076dcaf57

data/lib/binary_tree.rb

@@ -1,80 +1,114 @@
 class BinaryTree
-        attr_reader :data
-        attr_accessor :left, :right, :root
+  attr_reader :data
+  attr_accessor :left, :right, :root
+  
+  def initialize(data=nil)
+    @data = data
+    @left = nil
+    @right = nil
+  end
 
-        def initialize(data=nil)
-            @data = data
-            @left = nil
-            @right = nil
-        end
+  # insert data in binary tree node
+  def insert(node, data)
+    q = []
+    if node == nil
+      @root = BinaryTree.new(data)
+      return @root
+    end
+    q.push(node)
+    while (!q.empty?)
+      node = q.shift
+      if node.left == nil
+        node.left = BinaryTree.new(data)
+        break
+      else
+        q.push(node.left)
+      end
+      if node.right == nil
+        node.right = BinaryTree.new(data)
+        break
+      else
+        q.push(node.right)
+      end  
+    end
+    return node
+  end
 
-        # insert data in binary tree node
-        def insert(node, data)
-            q = []
-            if node == nil
-                @root = BinaryTree.new(data)
-                return @root
-            end
-            q.push(node)
-            while (!q.empty?)
-                node = q.shift
-                if node.left == nil
-                    node.left = BinaryTree.new(data)
-                    break
-                else
-                    q.push(node.left)
-                end
-                if node.right == nil
-                    node.right = BinaryTree.new(data)
-                    break
-                else
-                    q.push(node.right)
-                end
-            end
-            return node
-        end
-
-        # print data in inorder form (left, root, right)
-        def inorder(node)
-            if node == nil
-                return
-            end
-            inorder(node.left)
-            puts "#{node.data}"
-            inorder(node.right)
-        end
+  # print data in inorder form (left, root, right)
+  def inorder(node)
+    return if node == nil
+    inorder(node.left)
+    print "#{node.data} "
+    inorder(node.right)
+  end
         
-        # print data in preorder form (root, left, right)
-        def preorder(node)
-            if node == nil
-                return
-            end
-            puts "#{node.data}"            
-            preorder(node.left)
-            preorder(node.right)
-        end
+  # print data in preorder form (root, left, right)
+  def preorder(node)
+    return if node == nil
+    print "#{node.data} "            
+    preorder(node.left)
+    preorder(node.right)
+  end
+
+  # print data in postorder for (left, right, root)
+  def postorder(node)
+    return if node == nil
+    postorder(node.left)
+    postorder(node.right)
+    print "#{node.data} "            
+  end
 
-        # print data in postorder for (left, right, root)
-        def postorder(node)
-            if node == nil
-                return
-            end
-            postorder(node.left)
-            postorder(node.right)
-            puts "#{node.data}"            
-        end
+  # Postorder traversal using two stack in binary tree
+  def postorder_iterative(node)
+    return if node == nil
+    s1 = []
+    s2 = []
+    s1.push(node)
+    while(!s1.empty?)
+      node = s1.pop    
+      s2.push(node)
+      if node.left != nil
+        s1.push(node.left)
+      end
+      if node.right != nil
+        s1.push(node.right)
+      end
+    end 
+    while(!s2.empty?)
+      node = s2.pop
+      print "#{node.data} "
+    end
+    puts ""
+  end
+  
+  #level order tree traversal
+  def levelorder(node)
+    return if node == nil
+    q = []
+    q.push(node)
+    while(!q.empty?)
+      node = q.shift
+      if node.left != nil
+        q.push(node.left)
+      end
+      if node.right != nil
+        q.push(node.right)
+      end
+      print "#{node.data} "
+    end
+  end
 
-        # For test
-        def test_binary_tree
-            for i in 1..5 do
-                BinaryTree.new.insert(@@root, rand(100))
-            end
-            puts "inorder : "
-            inorder(@root)
-            puts "preorder : "
-            preorder(@root)
-            puts "postorder : "
-            postorder(@root)
-        end
+  # For test
+  def test_binary_tree
+    for i in 1..5 do
+      BinaryTree.new.insert(@@root, rand(100))
+    end
+    puts "inorder : "
+    inorder(@root)
+    puts "preorder : "
+    preorder(@root)
+    puts "postorder : "
+    postorder(@root)
+  end
 
-end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: binary_tree
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 1.0.1
 platform: ruby
 authors:
 - shubham jain
@@ -10,7 +10,7 @@ bindir: bin
 cert_chain: []
 date: 2020-03-29 00:00:00.000000000 Z
 dependencies: []
-description: A simple binary tree gem
+description: A simple binary tree gem with level order, postorder tree traversal
 email: shubhammpdgj@gmail.com
 executables: []
 extensions: []