Packages

case class Leaf[T](v: T) extends BinaryTree[T] with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, BinaryTree[T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Leaf
  2. Serializable
  3. Product
  4. Equals
  5. BinaryTree
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Leaf(v: T)

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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  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.

    Checks if the BinaryTree contains a certain element.

    Definition Classes
    BinaryTree
  7. def count[T](t: T): Int
    Definition Classes
    BinaryTree
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. 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.

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

    Definition Classes
    BinaryTree
  10. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  11. 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.

    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.

    Definition Classes
    BinaryTree
  12. 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.

    Definition Classes
    BinaryTree
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. def left: Option[BinaryTree[T]]
    Definition Classes
    BinaryTree
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  18. def productElementNames: Iterator[String]
    Definition Classes
    Product
  19. def remove[T](subTree: BinaryTree[T])(parentTree: BinaryTree[T] = this): BinaryTree[T]

    Removes the subTree from the parentTree.

    Removes the subTree from the parentTree.

    Definition Classes
    BinaryTree
  20. 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.

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

    Definition Classes
    BinaryTree
  21. def right: Option[BinaryTree[T]]
    Definition Classes
    BinaryTree
  22. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  23. def toList: List[T]
    Definition Classes
    BinaryTree
  24. def toSeq: Seq[T]
    Definition Classes
    BinaryTree
  25. def toSeqLeafValues: Seq[T]

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

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

    Definition Classes
    BinaryTree
  26. val v: T
  27. def value: Option[T]
    Definition Classes
    BinaryTree
  28. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  29. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  30. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from BinaryTree[T]

Inherited from AnyRef

Inherited from Any

Ungrouped