       if let l = self.L {
         l.insert(n)
       } else {
-        self.L = Candy(n, self)
+        self.L = BinaryTree(n, self)
       }
     } else if n == self.value {
       self.count += 1

      if let r = self.R {
        r.insert(n)
      } else {
        self.R = Candy(n, self)
      }
    }
  }

  return next
}

class BinaryTree {
  var value: Int
  var R: BinaryTree?
  var L: BinaryTree?
  var parent: BinaryTree?
  var count: Int

  init(_ v: Int, _ p: BinaryTree? = nil) {
    self.value = v
    self.count = 1
    self.parent = p
