case class BTree[T](value: T, left: Option[BTree[T]], right: Option[BTree[T]]) extends Product with Serializable

An immutable Binary Tree.

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

Instance Constructors

  1. new BTree(value: T, left: Option[BTree[T]], right: Option[BTree[T]])

Value Members

  1. def foreach(f: (T) ⇒ Unit): Unit
  2. def greatest: T

    The value of the right-most descendant node in this Tree.

  3. val left: Option[BTree[T]]
  4. def lowest: T

    The value of the left-most descendant node in this Tree.

  5. def pretty: String
  6. val right: Option[BTree[T]]
  7. def searchWith[S](other: S, pred: (S, BTree[T]) ⇒ Either[Option[BTree[T]], T]): Option[T]

    A generalized binary search with a custom "target test" predicate.

  8. val value: T