binary_tree 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 0a73fe5ef37eeaa90d7c7efff8c1c0d4663f6e9daf07637ba692565c29884d96
+  data.tar.gz: cf740fedf52fb09de5a892c91e8ed041853173d4920993fdd3760d61ca124ddb
+SHA512:
+  metadata.gz: de486b01b6696c1bf78efccc4b63fc2017ff71afd54b9b178d5e0cf791e6d3902e10e264730bbf566e221cff8d91ca7b14270c6cdebac5a50387495faae4f27b
+  data.tar.gz: 527d264a819c51f6d5cb8f1bbd7d685aba90e172c264ad41232d2925013a4db1a9e4d7827ca33715de757276a81b5bd46eabe61aed63e82d21bff623e67a2843

data/lib/binary_tree.rb

@@ -0,0 +1,80 @@
+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)
+            if node == nil
+                return
+            end
+            inorder(node.left)
+            puts "#{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 postorder for (left, right, root)
+        def postorder(node)
+            if node == nil
+                return
+            end
+            postorder(node.left)
+            postorder(node.right)
+            puts "#{node.data}"            
+        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.0
+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
+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: []