binary_tree 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: af13630aedbfafdaa8977f72f687e9741ad6a929a294ea81d6107903c1c1387f
+  data.tar.gz: 0c8d6ca0477b11e84bfea0ee325db8d6e9774d2936e262d38dc995ddd154779f
+SHA512:
+  metadata.gz: 3cbe7b5bd9b6a2f7db0a9579bd08d9bbb54f11964475a4aba3e8a795d2776fcc179ae41d0a021482620d7d08b77e6f9bf127e02dc89a5917da168bd1ef3e29cc
+  data.tar.gz: 1de26b3d8bfba6affc68f7b20d58b02b1414480d3f3b9ce5faf04bed6901c147d2f6ef161418eada8ff0d45d595ca3455597829f4f69f86e9bb3480f1828ff2f

data/lib/binary_tree.rb

@@ -0,0 +1,78 @@
+class BinaryTree
+        attr_reader :data
+        attr_accessor :left, :right
+        @@root = nil
+        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
+            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
+        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
+
+        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: 0.0.0
+platform: ruby
+authors:
+- shubham jain
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2020-03-11 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: []