edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree Class Reference
[Examples]
Classes | |
| class | Node |
Public Member Functions | |
| BinarySearchTree () | |
| Node | getRoot () |
| void | setRoot (Node root) |
| int | size () |
| boolean | repOk () |
| BinarySearchTree | insert (Node z) |
| Node | findNode (int keyToFind) |
| 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 | insertKey_squander (int k) |
| Node[] | getAllNodes_squander () |
| String | toString () |
| void | genBST () |
Static Public Member Functions | |
| static void | main (String[] args) |
Private Member Functions | |
| String | printNode (Node node) |
Private Attributes | |
| Node | root |
Static Private Attributes | |
| static final int | NUM_NODES = 20 |
Detailed Description
An implementation of the Binary Search Tree data structure with full specs. Manual implementation of the provided methods can be verified against the specs using JForge. The idea is to be able to run all those methods without having the actual implementation, but purely based on specs.
Definition at line 36 of file BinarySearchTree.java.
Constructor & Destructor Documentation
| edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.BinarySearchTree | ( | ) |
Definition at line 91 of file BinarySearchTree.java.
Member Function Documentation
| Node edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.findNode | ( | int | keyToFind | ) |
Definition at line 146 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertKey_squander(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertMix(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertNode_squander(), and edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testRemoveNode_squander().
| Node edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.findNode_squander | ( | int | keyToFind | ) |
Definition at line 192 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testFindNode_squander().
| void edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.genBST | ( | ) |
Definition at line 257 of file BinarySearchTree.java.
| Node [] edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.getAllNodes_squander | ( | ) |
Definition at line 229 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testGetAllNodes_squander().
| Node edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.getRoot | ( | ) |
Definition at line 95 of file BinarySearchTree.java.
| BinarySearchTree edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.insert | ( | Node | z | ) |
| void edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.insertKey_squander | ( | int | k | ) |
Definition at line 222 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertKey_squander().
| void edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.insertNode_squander | ( | Node | z | ) |
Definition at line 214 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.main(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertMix(), and edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertNode_squander().
| static void edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.main | ( | String[] | args | ) | [static] |
Definition at line 261 of file BinarySearchTree.java.
References edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.insert(), and edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.insertNode_squander().
| int edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.max | ( | ) |
Definition at line 172 of file BinarySearchTree.java.
| int edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.max_squander | ( | ) |
Definition at line 182 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testMax_squander().
| int edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.min | ( | ) |
Definition at line 161 of file BinarySearchTree.java.
| int edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.min_squander | ( | ) |
Definition at line 187 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testMin_squander().
| String edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.printNode | ( | Node | node | ) | [private] |
Definition at line 241 of file BinarySearchTree.java.
| void edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.removeNode_squander | ( | Node | nodeToRemove | ) |
Definition at line 199 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testRemoveNode_squander().
| boolean edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.repOk | ( | ) |
Definition at line 104 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testFindNode_squander(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertKey_squander(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertMix(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertNode_squander(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testMax_squander(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testMin_squander(), and edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testRemoveNode_squander().
| void edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.setRoot | ( | Node | root | ) |
Definition at line 96 of file BinarySearchTree.java.
| int edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.size | ( | ) |
Definition at line 98 of file BinarySearchTree.java.
Referenced by edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertKey_squander(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertMix(), edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testInsertNode_squander(), and edu.mit.csail.sdg.squander.examples.bst.BinarySearchTreeTest.testRemoveNode_squander().
| String edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.toString | ( | ) |
Definition at line 235 of file BinarySearchTree.java.
Member Data Documentation
final int edu.mit.csail.sdg.squander.examples.bst.BinarySearchTree.NUM_NODES = 20 [static, private] |
Definition at line 248 of file BinarySearchTree.java.
Definition at line 88 of file BinarySearchTree.java.
The documentation for this class was generated from the following file:
- examples/edu/mit/csail/sdg/squander/examples/bst/BinarySearchTree.java
