|
UC Berkeley Group for User Interface Research Updated November 17, 2000 |
|||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use BinaryTree | |
| edu.berkeley.guir.lib.graphs | Some simple graph utilities. |
| Uses of BinaryTree in edu.berkeley.guir.lib.graphs |
| Subclasses of BinaryTree in edu.berkeley.guir.lib.graphs | |
class |
BinarySearchTree
An tree that has at most two children per node ordered such that all values less than the root value will go to the left, and all values greater than the root value will go to the right. |
class |
PathTree
A Path Tree that represents a hierarchy of siblings and children. |
| Fields in edu.berkeley.guir.lib.graphs declared as BinaryTree | |
protected BinaryTree |
BinaryTree.left
|
protected BinaryTree |
BinaryTree.right
|
| Methods in edu.berkeley.guir.lib.graphs that return BinaryTree | |
protected BinaryTree |
BinaryTree._left()
Retrieve the left child of this tree. |
protected BinaryTree |
BinaryTree._right()
Retrieve the right child of this tree. |
| Methods in edu.berkeley.guir.lib.graphs with parameters of type BinaryTree | |
protected void |
BinaryTree._setLeft(BinaryTree left)
Set the left subtree of this BinaryTree. |
protected void |
BinaryTree._setRight(BinaryTree right)
Set the right subtree of this BinaryTree. |
| Constructors in edu.berkeley.guir.lib.graphs with parameters of type BinaryTree | |
BinaryTree(Object data,
BinaryTree left,
BinaryTree right)
Creates a binary tree with the specified object at the root. |
|
|
Copyright Information | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||