|
UC Berkeley Group for User Interface Research Updated November 17, 2000 |
|||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use BinarySearchTree | |
edu.berkeley.guir.lib.graphs | Some simple graph utilities. |
Uses of BinarySearchTree in edu.berkeley.guir.lib.graphs |
Methods in edu.berkeley.guir.lib.graphs that return BinarySearchTree | |
BinarySearchTree |
BinarySearchTree.left()
Return the left subtree. |
BinarySearchTree |
BinarySearchTree.right()
Return the right subtree. |
Methods in edu.berkeley.guir.lib.graphs with parameters of type BinarySearchTree | |
void |
BinarySearchTree.setLeft(BinarySearchTree root)
|
void |
BinarySearchTree.setRight(BinarySearchTree root)
|
boolean |
BinarySearchTree.existsHelper(Object obj,
BinarySearchTree root)
See if the specified Object is in the specified tree or not. |
|
Copyright Information | |||||||||
PREV NEXT | FRAMES NO FRAMES |