edu.mit.csail.sdg.squander.examples.bst.BST_noParent Class Reference
[Examples]

Inherited by edu.mit.csail.sdg.squander.examples.bst.BalancedBST.

Collaboration diagram for edu.mit.csail.sdg.squander.examples.bst.BST_noParent:
Collaboration graph
[legend]

List of all members.

Classes

class  Node

Public Member Functions

 BST_noParent ()
Node getRoot ()
void setRoot (Node root)
int size ()
boolean repOk ()
BST_noParent insertNode (Node z)
Node findNode (int keyToFind)
boolean findNode (Node n)
int min ()
int max ()
int max_squander ()
int min_squander ()
Node findNode_squander (int keyToFind)
void removeNode_squander (Node nodeToRemove)
void insertNode_squander (Node z)
void insertNode_slow_squander (Node z)
void insertKey_squander (int k)
Node[] getAllNodes_squander ()
String toString ()
void genBST ()

Static Public Member Functions

static void main (String[] args)

Protected Attributes

Node root

Private Member Functions

String printNode (Node node)

Static Private Attributes

static final int NUM_NODES = 20

Detailed Description

Binary search tree, whose nodes don't have the "parent" pointer, like in BinarySearchTree.

Author:
Aleksandar Milicevic

Definition at line 33 of file BST_noParent.java.


Constructor & Destructor Documentation

edu.mit.csail.sdg.squander.examples.bst.BST_noParent.BST_noParent (  ) 

Definition at line 80 of file BST_noParent.java.


Member Function Documentation

boolean edu.mit.csail.sdg.squander.examples.bst.BST_noParent.findNode ( Node  n  ) 

Definition at line 147 of file BST_noParent.java.

Node edu.mit.csail.sdg.squander.examples.bst.BST_noParent.findNode ( int  keyToFind  ) 
Node edu.mit.csail.sdg.squander.examples.bst.BST_noParent.findNode_squander ( int  keyToFind  ) 
void edu.mit.csail.sdg.squander.examples.bst.BST_noParent.genBST (  ) 

Definition at line 276 of file BST_noParent.java.

Node [] edu.mit.csail.sdg.squander.examples.bst.BST_noParent.getAllNodes_squander (  ) 
Node edu.mit.csail.sdg.squander.examples.bst.BST_noParent.getRoot (  ) 

Definition at line 84 of file BST_noParent.java.

void edu.mit.csail.sdg.squander.examples.bst.BST_noParent.insertKey_squander ( int  k  ) 
BST_noParent edu.mit.csail.sdg.squander.examples.bst.BST_noParent.insertNode ( Node  z  ) 
void edu.mit.csail.sdg.squander.examples.bst.BST_noParent.insertNode_slow_squander ( Node  z  ) 

Reimplemented in edu.mit.csail.sdg.squander.examples.bst.BalancedBST.

Definition at line 232 of file BST_noParent.java.

void edu.mit.csail.sdg.squander.examples.bst.BST_noParent.insertNode_squander ( Node  z  ) 
static void edu.mit.csail.sdg.squander.examples.bst.BST_noParent.main ( String[]  args  )  [static]
int edu.mit.csail.sdg.squander.examples.bst.BST_noParent.max (  ) 

Definition at line 175 of file BST_noParent.java.

int edu.mit.csail.sdg.squander.examples.bst.BST_noParent.max_squander (  ) 
int edu.mit.csail.sdg.squander.examples.bst.BST_noParent.min (  ) 

Definition at line 164 of file BST_noParent.java.

int edu.mit.csail.sdg.squander.examples.bst.BST_noParent.min_squander (  ) 
String edu.mit.csail.sdg.squander.examples.bst.BST_noParent.printNode ( Node  node  )  [private]

Definition at line 260 of file BST_noParent.java.

void edu.mit.csail.sdg.squander.examples.bst.BST_noParent.removeNode_squander ( Node  nodeToRemove  ) 
boolean edu.mit.csail.sdg.squander.examples.bst.BST_noParent.repOk (  ) 
void edu.mit.csail.sdg.squander.examples.bst.BST_noParent.setRoot ( Node  root  ) 

Definition at line 85 of file BST_noParent.java.

int edu.mit.csail.sdg.squander.examples.bst.BST_noParent.size (  ) 
String edu.mit.csail.sdg.squander.examples.bst.BST_noParent.toString (  ) 

Member Data Documentation

Definition at line 267 of file BST_noParent.java.

Definition at line 77 of file BST_noParent.java.


The documentation for this class was generated from the following file:
Generated by  doxygen 1.6.2-20100208