Node

Instance Constructors

new Node(index: Int, value: Some[T], left: Tree[T], right: Tree[T])

index
position in tree
value
value of the Node
left
left subTree
right
right sub Tree

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( ... )
val entries: Int

The number of nodes in this tree or subtree.
The number of nodes in this tree or subtree.

Definition Classes
Node → Tree
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

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

Definition Classes
AnyRef → Any
val index: Int

position in tree
position in tree

Definition Classes
Node → Tree
def isEmpty: Boolean

Returns whether the tree or subtree is empty.
Returns whether the tree or subtree is empty.

Definition Classes
Node → Tree
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val left: Tree[T]

left subTree
left subTree

Definition Classes
Node → Tree
def maxVal: Option[T]

The value of the node containing the maximum value
The value of the node containing the maximum value

Definition Classes
Node → Tree
def maxValIndex: Int

The index of the node containing the maximum value within the subtree.
The index of the node containing the maximum value within the subtree.

Definition Classes
Node → Tree
def minVal: Option[T]

The value of the node containing the minimum value
The value of the node containing the minimum value

Definition Classes
Node → Tree
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val right: Tree[T]

right sub Tree
right sub Tree

Definition Classes
Node → Tree
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toList: List[T]

Converts the tree to a list.
Converts the tree to a list.

Definition Classes
Node → Tree
val value: Some[T]

value of the Node
value of the Node

Definition Classes
Node → Tree
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 Doc: package infcalcs

case class Node[T](index: Int, value: Some[T], left: Tree[T], right: Tree[T]) extends Tree[T] with Product with Serializable

Instance Constructors

new Node(index: Int, value: Some[T], left: Tree[T], right: Tree[T])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val entries: Int

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

val index: Int

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

val left: Tree[T]

def maxVal: Option[T]

def maxValIndex: Int

def minVal: Option[T]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val right: Tree[T]

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

def toList: List[T]

val value: Some[T]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Tree[T]

Inherited from AnyRef

Inherited from Any

Ungrouped