binary_trees 0.0.1 → 0.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 4ab09804a82e404db72425b9848e6f1d8ead807424e24770a3c2d640a30e2879
-  data.tar.gz: b099346161b1732014822603e4f616ab4d0729b083952974c56b7c89746eca7f
+  metadata.gz: c16b0e76e938ac4c254d878e295f0339e27fde37ed973ab7022e16edd9baadb7
+  data.tar.gz: 343202d92502b14bb1165c7211290ac39efd7672f7b6ecad6eed678aa1bca3dc
 SHA512:
-  metadata.gz: 45477346a529f82ea8241fcadfff3377b3c94e7889b7bb9c6651b776ae2035c863d7b1593092a69ae9bbd7ddd6759fce921c9dcb806ea59c7d0d3d281d2a36e7
-  data.tar.gz: e11822bb88ced9f91e3b366bb07a835ce335825245c5e0167aa664bae4befcaf669def1d9651f42dbcd1197a63db65398bbe7e224ac97457f1f170a52e74bd31
+  metadata.gz: ca401a77cebd4b280ce457338441365dc3df2d5dd28a62c84b1133c9213cf03cb32bdd6551f6fe996d745c4ac62b8e381490b337b5bcc1063b5a0c68e666f34e
+  data.tar.gz: e723c1cc89c851f9bca0636d150bfa0390b13d4976176e7acf02656a0750e0e3eeb994fd1d14bea2fb798e024fd07e32cb6ff49ed134e4fd85c109814bdfc850

data/lib/binary_trees.rb

@@ -1,10 +1,10 @@
 class Array
-  def to_tree(i = 0)
+  def to_root(i = 0)
     root = nil
     if i < self.length
       root = TreeNode.new(self[i])
-      root.left = to_tree(i * 2 + 1)
-      root.right = to_tree(i * 2 + 2)
+      root.left = to_root(i * 2 + 1)
+      root.right = to_root(i * 2 + 2)
     end
     root
   end
@@ -21,6 +21,7 @@ class TreeNode
 end
 
 class Tree
+
   def initialize(root = nil)
     @root = root
   end
@@ -31,12 +32,21 @@ class Tree
     root.val + sum(root.left) + sum(root.right)
   end
 
-  def to_array(root = @root, arr = [], idx = 0)
+  def invert(root = @root)
+    return nil unless root
+
+    temp = root.left
+    root.left = invert(root.right)
+    root.right = invert(temp)
+    root
+  end
+
+  def to_a(root = @root, arr = [], idx = 0)
     return [] if root.nil?
 
     arr[idx] = root.val
-    to_array(root.left, arr, idx * 2 + 1) if root.left
-    to_array(root.right, arr, idx * 2 + 2) if root.right
+    to_a(root.left, arr, idx * 2 + 1) if root.left
+    to_a(root.right, arr, idx * 2 + 2) if root.right
     arr
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: binary_trees
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.3
 platform: ruby
 authors:
 - Queenie Peng
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2023-01-30 00:00:00.000000000 Z
+date: 2023-02-18 00:00:00.000000000 Z
 dependencies: []
 description: 
 email: 
@@ -38,6 +38,5 @@ requirements: []
 rubygems_version: 3.1.4
 signing_key: 
 specification_version: 4
-summary: Convert a binary tree to array and vice versa. Given a tree and can sum all
-  the tree node values.
+summary: Convert a binary tree to array and vice versa.
 test_files: []