bst.coffee

class BinarySearchTree

  constructor: () ->
    @val = null
    @size = 0
    @right = null
    @left = null

  insert: (val) ->
    if @val == val
      false
    else if @val == null
      @val = val
      @size++
    else if val < @val
      @left = new BinarySearchTree unless @left
      @size++ if @left.insert(val)
    else
      @right = new BinarySearchTree unless @right
      @size++ if @right.insert(val)

  contains: (val) ->
    if @val == val
      true
    else if val < @val
      return false unless @left
      @left.contains(val)
    else
      return false unless @right
      @right.contains(val)

exports.BinarySearchTree = BinarySearchTree