binary_tree 1.0.1

checksums.yaml

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

data/lib/binary_tree.rb

@@ -0,0 +1,114 @@
+class BinaryTree
+  attr_reader :data
+  attr_accessor :left, :right, :root
+  
+  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
+
+  # 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)
+    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
+
+  # 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
+
+end

metadata

@@ -0,0 +1,43 @@
+--- !ruby/object:Gem::Specification
+name: binary_tree
+version: !ruby/object:Gem::Version
+  version: 1.0.1
+platform: ruby
+authors:
+- shubham jain
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2020-03-29 00:00:00.000000000 Z
+dependencies: []
+description: A simple binary tree gem with level order, postorder tree traversal
+email: shubhammpdgj@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/binary_tree.rb
+homepage: https://github.com/shubhamjain108-lab/binary-tree/blob/master/binary_tree.rb
+licenses:
+- shubhamjain
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.0.3
+signing_key: 
+specification_version: 4
+summary: Implement binary tree node
+test_files: []