Range Minimum Query with Segment Trees-like datastructure

gistfile1.scala

object Sample {

  def parts(numbers: Vector[Any]): (Vector[Any], Vector[Any]) =
    numbers.splitAt(numbers.length / 2)

  def buildTree(numbers: Vector[Any]): Vector[Any] =
    numbers.length match {
      case 1 => numbers
      case _ => Vector(buildTree(parts(numbers)._1), buildTree(parts(numbers)._2))
    }
    
  def rmq(tree: Vector[Any]): Int =
    tree.length match {
      case 1 => {
        println("Min of" + tree + " is " + tree(0))
        tree(0).asInstanceOf[Int]
      }
      case _ => {
        val smallest = Math.min(rmq(tree(0).asInstanceOf[Vector[Any]]), rmq(tree(1).asInstanceOf[Vector[Any]]))
        println("Min of" + tree + " is " + smallest)
        smallest
      }
    }
    
  def nums: Vector[Int] = Vector(10, 20, 30)
  rmq(buildTree(nums))
 
}