Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##: Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.CloneNotSupportedException]) @native()

6.  def contains[T](t: T)(f: (T) => Boolean = (x: T) => x == t)(implicit tree: BinaryTree[T] = this): Boolean

   Checks if the BinaryTree contains a certain element.

7.  def count[T](t: T): Int
8.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9.  def equals(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef → Any

10.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.Throwable])

11.  def findFirstDFS[T](t: T)(f: (T) => Boolean = (x: T) => x == t)(implicit tree: BinaryTree[T] = this): Option[BinaryTree[T]]

    A function to find the first occurrence of a predicate inside a BinaryTree.

12.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

13.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

14.  def insert[T](subTree: BinaryTree[T])(implicit parentTree: BinaryTree[T]): BinaryTree[T]

    Inserts a tree into one of the two branches in a BinaryTree If it cannot insert it because the branches are not empty, it throws a RuntimeException.

15.  def insert[T](t: T)(implicit tree: BinaryTree[T] = this): BinaryTree[T]

    Inserts an element into one of the two branches in a BinaryTree.

    Inserts an element into one of the two branches in a BinaryTree. If it cannot insert it because the branches are not empty, it throws a RuntimeException.

16.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

17.  def left: Option[BinaryTree[T]]
18.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

19.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

20.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

21.  def remove[T](subTree: BinaryTree[T])(parentTree: BinaryTree[T] = this): BinaryTree[T]

    Removes the subTree from the parentTree.

22.  def replace[T](originalTree: BinaryTree[T], replacementTree: BinaryTree[T])(implicit parentTree: BinaryTree[T] = this): BinaryTree[T]

    Replaces all instances of the original tree with the replacement tree.

23.  def right: Option[BinaryTree[T]]
24.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

25.  def toList: List[T]
26.  def toSeq: Seq[T]
27.  def toSeqLeafValues: Seq[T]

    Creates a sequence with only the leaf values evaluates as depth first from left to right.

28.  def toString(): String

    Definition Classes

    AnyRef → Any

29.  def value: Option[T]
30.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

31.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

32.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()