tree_handler 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: d4f84c2af33d9bc188f1d79837dd4131b7d0505d78625c5729a63747eace2d94
+  data.tar.gz: 89e71bc1056c0aa5c5904540dc1c405d80013f7f53b9a204bc09566da027f022
+SHA512:
+  metadata.gz: 719a4923aad2588a5bf65102bf4643309248dc826177e4125e45fecd60855b062227819a43f221f10d443d44595de4e945a3817edaa205237908bec561c68cee
+  data.tar.gz: 8d5c93d3e4d0721a1e2c58cc582e2629b027c9b14c3cbf004b99c3079aae0336fdac4de500aaac49de03b326daf62be015a13ca18249bcc7eee881d3be493350

data/.gitignore

@@ -0,0 +1,11 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+# rspec failure tracking
+.rspec_status

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.travis.yml

@@ -0,0 +1,6 @@
+---
+language: ruby
+cache: bundler
+rvm:
+  - 2.6.3
+before_install: gem install bundler -v 2.1.4

data/Gemfile

@@ -0,0 +1,7 @@
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in tree_handler.gemspec
+gemspec
+
+gem "rake", "~> 12.0"
+gem "rspec", "~> 3.0"

data/Gemfile.lock

@@ -0,0 +1,34 @@
+PATH
+  remote: .
+  specs:
+    tree_handler (0.1.0)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    diff-lcs (1.4.4)
+    rake (12.3.3)
+    rspec (3.9.0)
+      rspec-core (~> 3.9.0)
+      rspec-expectations (~> 3.9.0)
+      rspec-mocks (~> 3.9.0)
+    rspec-core (3.9.2)
+      rspec-support (~> 3.9.3)
+    rspec-expectations (3.9.2)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.9.0)
+    rspec-mocks (3.9.1)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.9.0)
+    rspec-support (3.9.3)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  rake (~> 12.0)
+  rspec (~> 3.0)
+  tree_handler!
+
+BUNDLED WITH
+   2.1.4

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2020 Tristan Hörler
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,40 @@
+# TreeHandler
+
+Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/tree_handler`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+TODO: Delete this and the text above, and describe your gem
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'tree_handler'
+```
+
+And then execute:
+
+    $ bundle install
+
+Or install it yourself as:
+
+    $ gem install tree_handler
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/tree_handler.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "tree_handler"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/tree_handler.rb

@@ -0,0 +1,152 @@
+module TreeHandler
+  require 'tree_handler/node'
+
+  class Tree
+    attr_accessor :data, :root
+    include Comparable
+
+    def initialize(array)
+      @data = array.uniq
+      @root = build_tree
+    end
+
+    def build_tree(array = @data.dup)
+      root = Node.new(array.shift)
+      array.each do |value|
+        node = Node.new(value)
+        compare(root, node)
+      end
+      root
+    end
+
+    def insert(value)
+      @data.push(value)
+      node = Node.new(value)
+      compare(root, node)
+    end
+
+    def delete(value, parent_pointer = @root)
+      @data.delete(value)
+      node = find(value)
+      return nil if node.nil?
+
+      unless node == @root
+        parent = find_parent(value)
+        parent_pointer =
+          value < parent.value ? parent.left_child : parent.right_child
+      end
+
+      if node.left_child.nil?
+        return parent_pointer = node.right_child
+      elsif node.right_child.nil?
+        return parent_pointer = node.left_child
+      else
+        parent_pointer = node.left_child
+        compare(parent_pointer, node.right_child)
+      end
+    end
+
+    def find(value, node = @root)
+      if value == node.value
+        return node
+      elsif value < node.value
+        return nil if node.left_child.nil?
+        find(value, node.left_child)
+      elsif value > node.value
+        return nil if node.right_child.nil?
+        find(value, node.right_child)
+      end
+    end
+
+    def find_parent(value)
+      value == @root.value ? nil : find_parent_rec(value)
+    end
+
+    def find_parent_rec(value, node = @root)
+      value_left_child = node.left_child.nil? ? nil : node.left_child.value
+      value_right_child = node.right_child.nil? ? nil : node.right_child.value
+
+      if value == value_left_child || value == value_right_child
+        return node
+      elsif value < node.value
+        value_left_child.nil? ? nil : find_parent_rec(value, node.left_child)
+      elsif value > node.value
+        value_right_child.nil? ? nil : find_parent_rec(value, node.right_child)
+      end
+    end
+
+    def level_order(queue = [@root], no_block = [])
+      until queue.empty?
+        if block_given?
+          yield(queue.map(&:value))
+        else
+          no_block.push(queue.map(&:value))
+        end
+        (0...queue.count).each do
+          next_node = queue.shift
+          queue.push(next_node.left_child) unless next_node.left_child.nil?
+          queue.push(next_node.right_child) unless next_node.right_child.nil?
+        end
+      end
+      no_block
+    end
+
+    def level_order_rec(queue = [@root], no_block = [], &block)
+      queue_child = []
+      if block_given?
+        block.call(queue.map(&:value))
+      else
+        no_block.push(queue.map(&:value))
+      end
+
+      queue.each do |node|
+        queue_child.push(node.left_child) unless node.left_child.nil?
+        queue_child.push(node.right_child) unless node.right_child.nil?
+      end
+      level_order_rec(queue_child, no_block, &block) unless queue_child.empty?
+      no_block
+    end
+
+    %i[preorder inorder postorder].each do |method|
+      define_method(method) do |node = @root, no_block = [], &block|
+        parent =
+          Proc.new { block ? block.call(node.value) : no_block << node.value }
+
+        parent.call if method == :preorder
+        unless node.left_child.nil?
+          send(method, node.left_child, no_block, &block)
+        end
+        parent.call if method == :inorder
+        unless node.right_child.nil?
+          send(method, node.right_child, no_block, &block)
+        end
+        parent.call if method == :postorder
+        no_block
+      end
+    end
+
+    def depth(node)
+      node.nil? ? 0 : level_order([node]).size
+    end
+
+    def balanced?(root = @root)
+      left_height = depth(root.left_child)
+      right_height = depth(root.right_child)
+      (-1..1).include?(left_height - right_height)
+    end
+
+    def rebalance!
+      result = rebalance_ordering(@data.dup.sort)
+      @root = build_tree(result)
+    end
+
+    def rebalance_ordering(tree, result = [])
+      return if tree.size == 0
+      middle = tree.size / 2
+      result.push tree.slice!(middle)
+      rebalance_ordering(tree[0...middle], result)
+      rebalance_ordering(tree[(middle)..-1], result)
+      result
+    end
+  end
+end

data/lib/tree_handler/comparable.rb

@@ -0,0 +1,19 @@
+module TreeHandler
+  module Comparable
+    def compare(node_A, node_B)
+      if node_B.value < node_A.value
+        if node_A.left_child.nil?
+          node_A.left_child = node_B
+        else
+          compare(node_A.left_child, node_B)
+        end
+      else
+        if node_A.right_child.nil?
+          node_A.right_child = node_B
+        else
+          compare(node_A.right_child, node_B)
+        end
+      end
+    end
+  end
+end

data/lib/tree_handler/node.rb

@@ -0,0 +1,27 @@
+class Node
+  attr_accessor :value, :left_child, :right_child
+
+  def initialize(value)
+    @value = value
+    @left_child = nil
+    @right_child = nil
+  end
+end
+
+module Comparable
+  def compare(node_A, node_B)
+    if node_B.value < node_A.value
+      if node_A.left_child.nil?
+        node_A.left_child = node_B
+      else
+        compare(node_A.left_child, node_B)
+      end
+    else
+      if node_A.right_child.nil?
+        node_A.right_child = node_B
+      else
+        compare(node_A.right_child, node_B)
+      end
+    end
+  end
+end

data/lib/tree_handler/version.rb

@@ -0,0 +1,3 @@
+module TreeHandler
+  VERSION = "0.1.0"
+end

data/tree_handler.gemspec

@@ -0,0 +1,21 @@
+require_relative 'lib/tree_handler/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "tree_handler"
+  spec.version       = TreeHandler::VERSION
+  spec.authors       = ["Tristan Hörler"]
+  spec.email         = ["tristan.horler@gmail.com"]
+
+  spec.summary       = "Handling Search BinaryTree with ease"
+  spec.description   = "Set of functions to create, modify and search in a binary tree from a list." 
+  spec.homepage      = "https://github.com/Ichenn92/tree_handler"
+  spec.license       = "MIT"
+  spec.required_ruby_version = Gem::Requirement.new(">= 2.3.0")
+
+  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+end

metadata

@@ -0,0 +1,60 @@
+--- !ruby/object:Gem::Specification
+name: tree_handler
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Tristan Hörler
+autorequire:
+bindir: exe
+cert_chain: []
+date: 2020-09-22 00:00:00.000000000 Z
+dependencies: []
+description: Set of functions to create, modify and search in a binary tree from a
+  list.
+email:
+- tristan.horler@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/.tree_handler.rb.swp
+- lib/tree_handler.rb
+- lib/tree_handler/comparable.rb
+- lib/tree_handler/node.rb
+- lib/tree_handler/version.rb
+- tree_handler.gemspec
+homepage: https://github.com/Ichenn92/tree_handler
+licenses:
+- MIT
+metadata: {}
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.3.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.0.8
+signing_key:
+specification_version: 4
+summary: Handling Search BinaryTree with ease
+test_files: []