FullBinaryTreeOps

abstract def foldNode[A](node: Node)(f: (Node, Node, BL) ⇒ A, g: (LL) ⇒ A): A

abstract def root(t: T): Option[Node]

Returns the root node of the tree.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def children(node: Node): Iterable[Node]

Returns all the direct children of the given node.

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fold[A](tree: T)(f: (Either[BL, LL], Iterable[Node]) ⇒ A): Option[A]

def fold[A](node: Node)(f: (Either[BL, LL], Iterable[Node]) ⇒ A): A

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def label(node: Node): Either[BL, LL]

Returns the label attached to the given node.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def reduce[A](node: Node)(f: (Label, Iterable[A]) ⇒ A): A

def reduce[A](tree: T)(f: (Either[BL, LL], Iterable[A]) ⇒ A): Option[A]

def reduceNode[A](node: Node)(f: (BL, Iterable[A]) ⇒ A)(g: (LL) ⇒ A): A

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