Simple Binary Tree in Ruby

binary_tree.rb

class Node
	attr_accessor :value, :left, :right

	def initialize(value=nil)
		@value = value
	end
end

class BinaryTree
	attr_accessor :root, :num_loops
	protected :root

	def initialize
		@num_loops = 0
	end

	def insert(value)
		if @root == nil
			@root = Node.new(value)
			return
		end
		current = @root
		while true do
			@num_loops += 1
			if current.value > value
				if current.left == nil
					current.left = Node.new value
					break
				end
				current = current.left
			else
				if current.right == nil
					current.right = Node.new value
					break
				end
				current = current.right
			end
		end
	end

	def traverse
		if @root == nil 
			return nil
		end
		traverse_worker(@root)
	end

	def traverse_worker(node)
		if node == nil
			return
		end

		if node.left
			traverse_worker node.left
		end

		puts node.value

		if node.right
			traverse_worker node.right
		end
	end

	def generate(list)
		list.each do |value|
			insert(value)
		end
	end
end