rubytree 0.9.5 → 1.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: bf7999767fcf682dd01d0d9ff973f0a558886ffa
-  data.tar.gz: 81c934501850b65db378eee4e8ca7eb000776aa4
+SHA256:
+  metadata.gz: e9977428c2a28cf7d3a31ccc91047f646ec88c4f0da90663e9596dfb006ce0c6
+  data.tar.gz: 0e3a42cf9214d95e5f9deed0511c6728c5204a03a319b30a80d96daf3f20f505
 SHA512:
-  metadata.gz: 346e6286cbb6271c0eb8bdf54bbce6b2395922f3d9e4c1ff077b2582da4eb98c02b1328ceaeea5a96c45e859ce70ac3f0732779b5afab08666dcce922817622a
-  data.tar.gz: a0ff0475ab95f2e69a4b2d177f3708beafcb8255f4753cba25f6874760eb19c7f305eb6b3311fbe7476473dc231e4831f6fcfbbd39ba132769a9a5fe606fe28a
+  metadata.gz: f311eec1cf9a9710cb5905e5c7c691344bd60beb57b472462d40a81e12af475bb6bf328a6502aa8bbb9af17d5d350b163b5d8d36888835866c473b9ea6e13953
+  data.tar.gz: fdc9890aaf6e298d4400ee6f84398ced73dfdaf93c6fe87a4981dd35c5f17934e2a01e803d44351724c615f11e075fbf3181403cbb4343005452ee47fdfbe25e

data/Gemfile

@@ -3,12 +3,6 @@ source 'https://rubygems.org'
 # Specify your gem's dependencies in rubytree.gemspec
 gemspec
 
-group :development, :test do
-  gem "rake", "~> 10.4"
-  gem "test-unit", "~> 3.0"
-  gem "coveralls", ">= 0.7", :require => false, :platforms => :mri_21
-end
-
 # Local Variables:
 # mode: ruby
 # End:

data/Gemfile.lock

@@ -1,66 +1,97 @@
 PATH
   remote: .
   specs:
-    rubytree (0.9.5)
-      json (~> 1.8)
-      structured_warnings (~> 0.2)
+    rubytree (1.0.2)
+      json (~> 2.6.1)
+      structured_warnings (~> 0.4.0)
 
 GEM
   remote: https://rubygems.org/
   specs:
-    coveralls (0.8.1)
-      json (~> 1.8)
-      rest-client (>= 1.6.8, < 2)
-      simplecov (~> 0.10.0)
+    ast (2.4.2)
+    coveralls (0.8.23)
+      json (>= 1.8, < 3)
+      simplecov (~> 0.16.1)
       term-ansicolor (~> 1.3)
-      thor (~> 0.19.1)
-    docile (1.1.5)
-    domain_name (0.5.24)
-      unf (>= 0.0.5, < 1.0.0)
-    http-cookie (1.0.2)
-      domain_name (~> 0.5)
-    json (1.8.2)
-    mime-types (2.6.1)
-    netrc (0.10.3)
-    power_assert (0.2.3)
-    rake (10.4.2)
-    rdoc (4.2.0)
-    rest-client (1.8.0)
-      http-cookie (>= 1.0.2, < 2.0)
-      mime-types (>= 1.16, < 3.0)
-      netrc (~> 0.7)
+      thor (>= 0.19.4, < 2.0)
+      tins (~> 1.6)
+    diff-lcs (1.5.0)
+    docile (1.4.0)
+    json (2.6.1)
+    parallel (1.21.0)
+    parser (3.0.3.2)
+      ast (~> 2.4.1)
+    power_assert (2.0.1)
+    psych (4.0.3)
+      stringio
+    rainbow (3.0.0)
+    rake (13.0.6)
+    rdoc (6.4.0)
+      psych (>= 4.0.0)
+    regexp_parser (2.2.0)
+    rexml (3.2.5)
+    rspec (3.10.0)
+      rspec-core (~> 3.10.0)
+      rspec-expectations (~> 3.10.0)
+      rspec-mocks (~> 3.10.0)
+    rspec-core (3.10.1)
+      rspec-support (~> 3.10.0)
+    rspec-expectations (3.10.1)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.10.0)
+    rspec-mocks (3.10.2)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.10.0)
+    rspec-support (3.10.3)
     rtags (0.97)
     rtagstask (0.0.4)
       rtags (> 0.0.0)
-    simplecov (0.10.0)
-      docile (~> 1.1.0)
-      json (~> 1.8)
+    rubocop (1.24.0)
+      parallel (~> 1.10)
+      parser (>= 3.0.0.0)
+      rainbow (>= 2.2.2, < 4.0)
+      regexp_parser (>= 1.8, < 3.0)
+      rexml
+      rubocop-ast (>= 1.15.0, < 2.0)
+      ruby-progressbar (~> 1.7)
+      unicode-display_width (>= 1.4.0, < 3.0)
+    rubocop-ast (1.15.1)
+      parser (>= 3.0.1.1)
+    ruby-progressbar (1.11.0)
+    simplecov (0.16.1)
+      docile (~> 1.1)
+      json (>= 1.8, < 3)
       simplecov-html (~> 0.10.0)
-    simplecov-html (0.10.0)
-    structured_warnings (0.2.0)
-    term-ansicolor (1.3.0)
+    simplecov-html (0.10.2)
+    stringio (3.0.1)
+    structured_warnings (0.4.0)
+    sync (0.5.0)
+    term-ansicolor (1.7.1)
       tins (~> 1.0)
-    test-unit (3.1.1)
+    test-unit (3.5.3)
       power_assert
-    thor (0.19.1)
-    tins (1.5.2)
-    unf (0.1.4)
-      unf_ext
-    unf_ext (0.0.7.1)
-    yard (0.8.7.6)
+    thor (1.1.0)
+    tins (1.30.0)
+      sync
+    unicode-display_width (2.1.0)
+    webrick (1.7.0)
+    yard (0.9.27)
+      webrick (~> 1.7.0)
 
 PLATFORMS
   ruby
 
 DEPENDENCIES
-  bundler (~> 1.7)
-  coveralls (>= 0.7)
-  rake (~> 10.4)
-  rdoc (~> 4.2)
-  rtagstask (~> 0.0)
+  bundler (~> 2.3.4)
+  coveralls (>= 0.8.23)
+  rake (>= 13.0.6)
+  rdoc (>= 6.4.0)
+  rspec (~> 3.10.0)
+  rtagstask (~> 0.0.4)
+  rubocop (>= 1.24.0)
   rubytree!
-  test-unit (~> 3.0)
-  yard (~> 0.8)
+  test-unit (>= 3.5.3)
+  yard (~> 0.9.27)
 
 BUNDLED WITH
-   1.10.2
+   2.3.4

data/History.rdoc

@@ -1,7 +1,23 @@
-# @markup rdoc
-
 = History of Changes
 
+=== 0.9.7 / 2015-12-31
+
+* Released 0.9.6. This is a minor bug-fix release.
+
+* This release allows the {Tree::TreeNode#print_tree} method to be used on
+  non-root nodes. Thanks to {https://github.com/ojab Ojab}.
+
+* The spaceship operator ('<=>') now returns 'nil' if the object being compared
+  to is itself 'nil' or not another {Tree::TreeNode}.
+
+=== 0.9.6 / 2015-05-30
+
+* Released 0.9.6, which is same as 0.9.5, except for an update to the Gem release date.
+
+=== 0.9.5 / 2015-05-30
+
+* Released 0.9.5.
+
 === 0.9.5pre7 / 2015-05-30
 
 * Added new methods for getting the path of a node as a string. These have been

data/LICENSE.md

@@ -1,7 +1,6 @@
 [RubyTree][]  is licensed under the [BSD][] license.
 
-Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015
-Anupam Sengupta (<anupamsg@gmail.com>).
+Copyright (c) 2006-2021 Anupam Sengupta (<anupamsg@gmail.com>).
 
 All rights reserved.
 

data/README.md

@@ -1,17 +1,15 @@
 <!--
   README.md
 
-  Copyright (C) 2006-2015 Anupam Sengupta (anupamsg@gmail.com)
+  Copyright (C) 2006-2017, 2020 Anupam Sengupta (anupamsg@gmail.com)
 
 -->
 # **RubyTree** #
 
 [![Gem Version](https://badge.fury.io/rb/rubytree.png)](http://badge.fury.io/rb/rubytree)
 [![Travis Build Status](https://secure.travis-ci.org/evolve75/RubyTree.png)](http://travis-ci.org/evolve75/rubytree)
-[![Dependency Status](https://gemnasium.com/evolve75/RubyTree.png)](https://gemnasium.com/evolve75/RubyTree)
 [![Code Climate](https://codeclimate.com/github/evolve75/RubyTree.png)](https://codeclimate.com/github/evolve75/RubyTree)
 [![Coverage Status](https://coveralls.io/repos/evolve75/RubyTree/badge.png)](https://coveralls.io/r/evolve75/RubyTree)
-[![githalytics.com alpha](https://cruel-carlota.pagodabox.com/473b881f1075bf9f255f0181dde6068f)](http://githalytics.com/evolve75/RubyTree)
 
 ## DESCRIPTION: ##
 
@@ -104,6 +102,9 @@ siblings_of_child1 = child1.siblings
 # ..... Retrieve immediate children of the root node as an array.
 children_of_root = root_node.children
 
+# ..... Retrieve the parent of a node.
+parent = child1.parent
+
 # ..... This is a depth-first and L-to-R pre-ordered traversal.
 root_node.each { |node| node.content.reverse }
 
@@ -118,7 +119,7 @@ This example can also be found at
 
 ## REQUIREMENTS: ##
 
-* [Ruby][] 1.8.x, 1.9.x, 2.0.x, or 2.1.x.
+* [Ruby][] 2.2.x, 2.3.x or 2.4.x
 
 
 * Run-time Dependencies:
@@ -130,6 +131,7 @@ This example can also be found at
     * [Bundler][] for creating the stable build environment
     * [Rake][] for building the package
     * [Yard][] for the documentation
+    * [RSpec][] for additional Ruby Spec test files
 
 ## INSTALL: ##
 
@@ -241,8 +243,8 @@ A big thanks to the following contributors for helping improve **RubyTree**:
 [BSD]:                  http://opensource.org/licenses/bsd-license.php "BSD License"
 [Binary tree]:          http://en.wikipedia.org/wiki/Binary_tree "Binary Tree Data Structure"
 [Bundler]:              http://bundler.io "Bundler"
-[Comparable]:           http://ruby-doc.org/core-1.8.7/Comparable.html "Comparable mix-in"
-[Enumerable]:           http://ruby-doc.org/core-1.9.3/Enumerable.html "Enumerable mix-in"
+[Comparable]:           http://ruby-doc.org/core-2.4.2/Comparable.html "Comparable mix-in"
+[Enumerable]:           http://ruby-doc.org/core-2.4.2/Enumerable.html "Enumerable mix-in"
 [JSON]:                 http://flori.github.com/json "JSON"
 [Rake]:                 https://rubygems.org/gems/rake "Rake"
 [Ruby]:                 http://www.ruby-lang.org "Ruby Programming Language"
@@ -251,7 +253,7 @@ A big thanks to the following contributors for helping improve **RubyTree**:
 [breadth-first]:        http://en.wikipedia.org/wiki/Breadth-first_search "Breadth-first (level-first) Traversal"
 [git]:                  http://git-scm.com "Git SCM"
 [in-order]:             http://en.wikipedia.org/wiki/Tree_traversal#In-order "In-order (symmetric) Traversal"
-[marshaling]:           http://ruby-doc.org/core-1.8.7/Marshal.html "Marshaling in Ruby"
+[marshaling]:           http://ruby-doc.org/core-2.4.2/Marshal.html "Marshaling in Ruby"
 [post-order]:           http://en.wikipedia.org/wiki/Tree_traversal#Post-order "Post-ordered Traversal"
 [pre-order]:            http://en.wikipedia.org/wiki/Tree_traversal#Pre-order "Pre-ordered Traversal"
 [rt@github]:            http://github.com/evolve75/RubyTree "RubyTree Project Page on Github"
@@ -261,6 +263,6 @@ A big thanks to the following contributors for helping improve **RubyTree**:
 [rt_site]:              http://rubytree.anupamsg.me "RubyTree Site"
 [structured_warnings]:  http://github.com/schmidt/structured_warnings "structured_warnings"
 [tree_data_structure]:  http://en.wikipedia.org/wiki/Tree_data_structure "Tree Data Structure"
-
+[RSpec]:                https://relishapp.com/rspec/
 
 [![Bitdeli Badge](https://d2weczhvl823v0.cloudfront.net/evolve75/rubytree/trend.png)](https://bitdeli.com/free "Bitdeli Badge")

data/Rakefile

@@ -2,7 +2,7 @@
 #
 # Rakefile - This file is part of the RubyTree package.
 #
-# Copyright (c) 2006-2015  Anupam Sengupta
+# Copyright (c) 2006-2021  Anupam Sengupta
 #
 # All rights reserved.
 #
@@ -33,46 +33,47 @@
 #
 
 require 'rubygems'
-GEM_SPEC = eval(File.read("rubytree.gemspec")) # Load the gemspec.
+GEM_SPEC = eval(File.read('./rubytree.gemspec')) # Load the gemspec.
 
 PKG_NAME = GEM_SPEC.name
 PKG_VER  = GEM_SPEC.version
 GEM_NAME = "#{PKG_NAME}-#{PKG_VER}.gem"
 
-desc "Default Task (Run the tests)"
+desc 'Default Task (Run the tests)'
 task :default do
-  if ENV["COVERAGE"]
-    Rake::Task["test:coverage"].invoke
+  if ENV['COVERAGE']
+    Rake::Task['test:coverage'].invoke
   else
-    Rake::Task["test:unit"].invoke
+    Rake::Task['test:unit'].invoke
+    Rake::Task['spec'].invoke
   end
 end
 
-desc "Display the current gem version"
+desc 'Display the current gem version'
 task :version do
   puts "Current Version: #{GEM_NAME}"
 end
 
 require 'rake/clean'
-task :clean => 'gem:clobber_package'
+task clean: 'gem:clobber_package'
 CLEAN.include('coverage')
-task :clobber => [:clean, 'doc:clobber_rdoc', 'doc:clobber_yard']
+task clobber: [:clean, 'doc:clobber_rdoc', 'doc:clobber_yard']
 
-desc "Open an irb session preloaded with this library"
+desc 'Open an irb session preloaded with this library'
 task :console do
-  sh "irb -rubygems -r ./lib/tree.rb"
+  sh 'irb -rubygems -r ./lib/tree.rb'
 end
 
-namespace :doc do               # ................................ Documentation
+namespace :doc do # ................................ Documentation
   begin
-    gem 'rdoc', ">= 2.4.2"      # To get around a stupid bug in Ruby 1.9.2 Rake.
+    gem 'rdoc', '>= 6.4.0' # To get around a stupid bug in Ruby 1.9.2 Rake.
     require 'rdoc/task'
     Rake::RDocTask.new do |rdoc|
       rdoc.rdoc_dir = 'rdoc'
       rdoc.title    = "#{PKG_NAME}-#{PKG_VER}"
       rdoc.main     = 'README.rdoc'
       rdoc.rdoc_files.include(GEM_SPEC.extra_rdoc_files)
-      rdoc.rdoc_files.include('lib/**/*.rb')
+      rdoc.rdoc_files.include('./lib/**/*.rb')
     end
   rescue LoadError
     # Oh well.
@@ -82,23 +83,22 @@ namespace :doc do               # ................................ Documentation
     require 'yard'
     YARD::Rake::YardocTask.new do |t|
       t.files   = ['lib/**/*.rb', '-', GEM_SPEC.extra_rdoc_files]
-      t.options = ['--no-private', '--embed-mixins']
+      t.options = %w[--no-private --embed-mixins]
     end
   rescue LoadError
     # Oh well.
   end
 
-  desc "Remove YARD Documentation"
+  desc 'Remove YARD Documentation'
   task :clobber_yard do
     rm_rf 'doc'
   end
 end
 
-desc "Run the test cases"
-task :test => 'test:unit'
-
-namespace :test do              # ................................ Test related
+desc 'Run the test cases'
+task test: 'test:unit'
 
+namespace :test do # ................................ Test related
   require 'rake/testtask'
   Rake::TestTask.new(:unit) do |test|
     test.libs << 'lib' << 'test'
@@ -106,7 +106,7 @@ namespace :test do              # ................................ Test related
     test.verbose = false
   end
 
-  desc "Run the examples"
+  desc 'Run the examples'
   Rake::TestTask.new(:examples) do |example|
     example.libs << 'lib' << 'examples'
     example.pattern = 'examples/**/example_*.rb'
@@ -114,7 +114,7 @@ namespace :test do              # ................................ Test related
     example.warning = false
   end
 
-  desc "Run the code coverage"
+  desc 'Run the code coverage'
   task :coverage do
     ruby 'test/run_test.rb'
   end
@@ -122,7 +122,7 @@ namespace :test do              # ................................ Test related
   begin
     require 'rcov/rcovtask'
     Rcov::RcovTask.new(:rcov) do |t|
-      t.libs << "test"
+      t.libs << 'test'
       t.test_files = FileList['test/**/test_*.rb']
       t.verbose = true
       t.rcov_opts << '--exclude /gems/,/Library/,/usr/,spec,lib/tasks'
@@ -130,20 +130,28 @@ namespace :test do              # ................................ Test related
   rescue LoadError
     # Oh well. Can't have everything.
   end
+end
+
+begin # ................................ rspec tests
+  require 'rspec/core/rake_task'
 
+  RSpec::Core::RakeTask.new(:spec) do |t|
+    t.fail_on_error = false
+    t.rspec_opts = ['--color', '--format doc']
+  end
+rescue LoadError
+  # Cannot load rspec.
 end
 
- namespace :tag do               # ................................ Emacs Tags
-  begin
-    require 'rtagstask'
-    RTagsTask.new(:tags) do |rd|
-      rd.vi = false
-      CLEAN.include('TAGS')
-    end
-  rescue LoadError
-    # Oh well. Can't have everything.
+namespace :tag do # ................................ Emacs Tags
+  require 'rtagstask'
+  RTagsTask.new(:tags) do |rd|
+    rd.vi = false
+    CLEAN.include('TAGS')
   end
- end
+rescue LoadError
+  # Oh well. Can't have everything.
+end
 
 namespace :gem do               # ................................ Gem related
   require 'rubygems/package_task'
@@ -152,8 +160,8 @@ namespace :gem do               # ................................ Gem related
     pkg.need_tar = true
   end
 
-  desc "Push the gem into the Rubygems repository"
-  task :push => :gem do
+  desc 'Push the gem into the Rubygems repository'
+  task push: :gem do
     sh "gem push pkg/#{GEM_NAME}"
   end
 end

data/examples/example_basic.rb

@@ -3,8 +3,8 @@
 # example_basic.rb:: Basic usage of the tree library.
 #
 # Author:  Anupam Sengupta
-# Time-stamp: <2013-12-28 12:14:20 anupam>
-# Copyright (C) 2013 Anupam Sengupta <anupamsg@gmail.com>
+# Time-stamp: <2015-12-31 22:17:30 anupam>
+# Copyright (C) 2013, 2015 Anupam Sengupta <anupamsg@gmail.com>
 #
 # The following example implements this tree structure:
 #
@@ -23,22 +23,22 @@
 #    +---------------+
 
 # ..... Example starts.
-require 'tree'                 # Load the library
+require 'tree' # Load the library
 
 # ..... Create the root node first.  Note that every node has a name and an optional content payload.
-root_node = Tree::TreeNode.new("ROOT", "Root Content")
+root_node = Tree::TreeNode.new('ROOT', 'Root Content')
 root_node.print_tree
 
 # ..... Now insert the child nodes.  Note that you can "chain" the child insertions for a given path to any depth.
-root_node << Tree::TreeNode.new("CHILD1", "Child1 Content") << Tree::TreeNode.new("GRANDCHILD1", "GrandChild1 Content")
-root_node << Tree::TreeNode.new("CHILD2", "Child2 Content")
+root_node << Tree::TreeNode.new('CHILD1', 'Child1 Content') << Tree::TreeNode.new('GRANDCHILD1', 'GrandChild1 Content')
+root_node << Tree::TreeNode.new('CHILD2', 'Child2 Content')
 
 # ..... Lets print the representation to stdout.  This is primarily used for debugging purposes.
 root_node.print_tree
 
 # ..... Lets directly access children and grandchildren of the root.  The can be "chained" for a given path to any depth.
-child1       = root_node["CHILD1"]
-grand_child1 = root_node["CHILD1"]["GRANDCHILD1"]
+child1       = root_node['CHILD1']
+grand_child1 = root_node['CHILD1']['GRANDCHILD1']
 
 # ..... Now lets retrieve siblings of the current node as an array.
 siblings_of_child1 = child1.siblings
@@ -46,6 +46,9 @@ siblings_of_child1 = child1.siblings
 # ..... Lets retrieve immediate children of the root node as an array.
 children_of_root = root_node.children
 
+# ..... Retrieve the parent of a node.
+parent = child1.parent
+
 # ..... This is a depth-first and L-to-R pre-ordered traversal.
 root_node.each { |node| node.content.reverse }
 

data/lib/rubytree.rb

@@ -38,4 +38,4 @@
 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #
 
-require "tree.rb"
+require 'tree'

data/lib/tree/binarytree.rb

@@ -38,10 +38,9 @@
 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #
 
-require 'tree'
+require_relative '../tree'
 
 module Tree
-
   # Provides a Binary tree implementation. This node allows only two child nodes
   # (left and right child). It also provides direct access to the left or right
   # child, including assignment to the same.
@@ -51,7 +50,6 @@ module Tree
   # @author Anupam Sengupta
   #
   class BinaryTreeNode < TreeNode
-
     # @!group Core Attributes
 
     # @!attribute [rw] left_child
@@ -85,6 +83,7 @@ module Tree
     # @return [Boolean] +true+ if this is the left child of its parent.
     def is_left_child?
       return false if is_root?
+
       self == parent.left_child
     end
 
@@ -95,6 +94,7 @@ module Tree
     # @return [Boolean] +true+ if this is the right child of its parent.
     def is_right_child?
       return false if is_root?
+
       self == parent.right_child
     end
 
@@ -114,12 +114,11 @@ module Tree
     # @raise [ArgumentError] This exception is raised if two children are
     #                        already present.
     def add(child)
-      raise ArgumentError, "Already has two child nodes" if @children.size == 2
+      raise ArgumentError, 'Already has two child nodes' if @children.size == 2
 
       super(child)
     end
 
-
     # Instantiate and insert child nodes from data in a Ruby +Hash+
     #
     # This method is used in conjunction with {Tree::TreeNode.from_hash} to
@@ -150,12 +149,13 @@ module Tree
     # @raise [ArgumentError] This exception is raised if a non-hash is passed.
     # @return [Array] Array of child nodes added
     def add_from_hash(hashed_subtree)
-      raise ArgumentError, "Too many children"\
+      raise ArgumentError, 'Too many children'\
                            if hashed_subtree.size + @children.size > 2
+
       super(hashed_subtree)
     end
 
-    # Performs inorder traversal (including this node).
+    # Performs in-order traversal (including this node).
     #
     # @yieldparam node [Tree::BinaryTreeNode]  Each node (in-order).
     #
@@ -164,29 +164,30 @@ module Tree
     #
     # @since 0.9.0
     #
+    # @param [Object] block
+    #
     # @see #each
     # @see #preordered_each
     # @see #postordered_each
-    def inordered_each(&block)
-
-      return self.to_enum unless block_given?
+    # noinspection RubyUnusedLocalVariable
+    def inordered_each
+      return to_enum unless block_given?
 
       node_stack = []
       current_node = self
 
-      until node_stack.empty? and current_node == nil
+      until node_stack.empty? and current_node.nil?
         if current_node
           node_stack.push(current_node)
           current_node = current_node.left_child
         else
-          current_node = node_stack.pop()
+          current_node = node_stack.pop
           yield current_node
           current_node = current_node.right_child
         end
       end
 
-      return self if block_given?
-
+      self if block_given?
     end
 
     # A protected method to allow insertion of child nodes at the specified
@@ -201,7 +202,7 @@ module Tree
     #
     # @raise [ArgumentError] If the index is out of limits.
     def set_child_at(child, at_index)
-      raise ArgumentError "A binary tree cannot have more than two children."\
+      raise ArgumentError 'A binary tree cannot have more than two children.'\
                           unless (0..1).include? at_index
 
       @children[at_index]        = child
@@ -242,9 +243,7 @@ module Tree
 
     # Swaps the left and right child nodes of the receiver node with each other.
     def swap_children
-      self.left_child, self.right_child = self.right_child, self.left_child
+      self.left_child, self.right_child = right_child, left_child
     end
-
   end
-
 end

data/lib/tree/tree_deps.rb

@@ -2,7 +2,7 @@
 #
 # = rubytree_deps.rb - Dependencies for RubyTree
 #
-# Centralizes and lists the dependencies forthe RubyTree gem.
+# Centralizes and lists the dependencies for the RubyTree gem.
 #
 # Author:: Anupam Sengupta (anupamsg@gmail.com)
 #
@@ -40,10 +40,10 @@
 require 'structured_warnings'
 require 'json'
 
-require 'tree/version'
-require 'tree/utils/metrics_methods'
-require 'tree/utils/path_methods'
-require 'tree/utils/camel_case_method_handler'
-require 'tree/utils/json_converter'
-require 'tree/utils/tree_merge_handler'
-require 'tree/utils/hash_converter'
+require_relative '../tree/version'
+require_relative '../tree/utils/metrics_methods'
+require_relative '../tree/utils/path_methods'
+require_relative '../tree/utils/camel_case_method_handler'
+require_relative '../tree/utils/json_converter'
+require_relative '../tree/utils/tree_merge_handler'
+require_relative '../tree/utils/hash_converter'