Tree

Abstract binary tree definition that defines the methods and properties of each node in the tree: regular nodes are implemented by the class Node, while empty nodes (indicating that their parent is a terminal node) are implemented by the singleton object EmptyTree.

Implemented by the class Node and the object EmptyTree. A binary tree for a set of numbers (Doubles) is constructed by first obtaining an ordered (but unconnected) list of Node instances using the function Tree.buildOrderedNodeList. The ordered list of Nodes returned by this function can then be passed to the function Tree.buildTree to return an instance of Tree containing the binary tree.

Linear Supertypes

AnyRef, Any

Known Subclasses

EmptyTree, Node

Abstract Value Members

abstract val entries: Int

The number of nodes in this tree or subtree.
abstract val index: Int

The index of this node.
abstract def isEmpty: Boolean

Returns whether the tree or subtree is empty.
abstract val left: Tree[T]

The "left" subtree.
abstract def maxVal: Option[T]

The value of the node containing the maximum value
abstract def maxValIndex: Int

The index of the node containing the maximum value within the subtree.
abstract def minVal: Option[T]

The value of the node containing the minimum value
abstract val right: Tree[T]

The "right" subtree.
abstract def toList: List[T]

Converts the tree to a list.
abstract val value: Option[T]

The value associated with this node.

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object Tree | package infcalcs

sealed trait Tree[+T] extends AnyRef

Abstract Value Members

abstract val entries: Int

abstract val index: Int

abstract def isEmpty: Boolean

abstract val left: Tree[T]

abstract def maxVal: Option[T]

abstract def maxValIndex: Int

abstract def minVal: Option[T]

abstract val right: Tree[T]

abstract def toList: List[T]

abstract val value: Option[T]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped