Binary_Search_Tree

binary_search_tree.rb

class Node
  attr_accessor :left_child, :right_child
  attr_reader :value

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

end

class Tree
  attr_reader :head

  def build_tree(array)
    mid_point = array[array.length/2]
    @head = Node.new(mid_point)
    left = array[0...array.length/2]
    right = array[(array.length/2 + 1)..-1]
    if left.length > 0
      @head.left_child = _build_tree(left)
    end

    if right.length > 0
      @head.right_child = _build_tree(right)
    end

  end

  def _build_tree(array)
    if array.length != 1
      mid_point = array[array.length/2]
      left = array[0...array.length/2]
      right = array[(array.length/2 + 1)..-1]
      node = Node.new(mid_point)
      if left.length > 0
        node.left_child = _build_tree(left)
      end

      if right.length > 0
        node.right_child = _build_tree(right)
      end
      return node
    else
      return Node.new(array[0])
    end
 
  end