All Packages Class Hierarchy This Package Previous Next Index
Class jdsl.core.ref.LinkedBinaryTree
java.lang.Object
|
+----jdsl.core.ref.LinkedBinaryTree
- public class LinkedBinaryTree
- extends Object
- implements BinaryTree
This class is a speedy implementation of the BinaryTree interface.
It implements only the following subset of BinaryTree's methods:
size,isEmpty,replace,leftChild,rightChild,parent,isInternal,isExternal,
isRoot,root,and expandExternal.
- Author:
- Luca Vismara, Roberto Tamassia
- See Also:
- BinaryTree
-
LinkedBinaryTree()
-
-
children(Position)
-
-
cut(Position)
-
-
elements()
-
-
expandExternal(Position)
-
-
isEmpty()
-
-
isExternal(Position)
-
-
isInternal(Position)
-
-
isRoot(Position)
-
-
leftChild(Position)
-
-
link(Position, BinaryTree)
-
-
newContainer()
-
-
parent(Position)
-
-
positions()
-
-
removeAboveExternal(Position)
-
-
replace(Position, Object)
-
-
replaceSubtree(Position, BinaryTree)
-
-
rightChild(Position)
-
-
root()
-
-
sibling(Position)
-
-
siblings(Position)
-
-
size()
-
-
swap(Position, Position)
-
LinkedBinaryTree
public LinkedBinaryTree()
size
public int size()
isEmpty
public boolean isEmpty()
replace
public Object replace(Position v,
Object o)
leftChild
public Position leftChild(Position v)
rightChild
public Position rightChild(Position v)
parent
public Position parent(Position v)
isInternal
public boolean isInternal(Position v)
isExternal
public boolean isExternal(Position v)
isRoot
public boolean isRoot(Position v)
root
public Position root()
expandExternal
public void expandExternal(Position v)
newContainer
public Container newContainer()
children
public Enumeration children(Position v)
siblings
public Enumeration siblings(Position v)
sibling
public Position sibling(Position v)
elements
public Enumeration elements()
positions
public Enumeration positions()
swap
public void swap(Position v,
Position w)
removeAboveExternal
public void removeAboveExternal(Position v)
cut
public BinaryTree cut(Position subtreeRoot)
link
public void link(Position mustBeExternal,
BinaryTree newSubtree)
replaceSubtree
public BinaryTree replaceSubtree(Position subtreeRoot,
BinaryTree newSubtree)
All Packages Class Hierarchy This Package Previous Next Index