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

Inherits edu::mit::csail::sdg::squander::examples::bst::BST_noParent.

Collaboration diagram for edu.mit.csail.sdg.squander.examples.bst.BalancedBST:

[legend]

List of all members.

Public Member Functions
boolean	repOk ()
void	insertKey_squander (int k)
void	insertNode_slow_squander (Node z)
void	removeNode_squander (Node nodeToRemove)
Static Public Member Functions
static void	main (String[] args)
Private Member Functions
boolean	check (Node n)
Private Attributes
final int[]	diff = new int[] {-1, 0, 1}

---

Detailed Description

Balanced binary search tree.

Adds an additional invariant to ensure that for every tree node n, the sizes of its left and right subtrees don't differ by more than 1.

Author:

Aleksandar Milicevic

Definition at line 22 of file BalancedBST.java.

---

Member Function Documentation

boolean edu.mit.csail.sdg.squander.examples.bst.BalancedBST.check

(

Node

n

)

[private]

Definition at line 34 of file BalancedBST.java.

void edu.mit.csail.sdg.squander.examples.bst.BalancedBST.insertKey_squander

(

int

k

)

Reimplemented from edu.mit.csail.sdg.squander.examples.bst.BST_noParent.

Definition at line 54 of file BalancedBST.java.

void edu.mit.csail.sdg.squander.examples.bst.BalancedBST.insertNode_slow_squander

(

Node

z

)

Reimplemented from edu.mit.csail.sdg.squander.examples.bst.BST_noParent.

Definition at line 60 of file BalancedBST.java.

static void edu.mit.csail.sdg.squander.examples.bst.BalancedBST.main

(

String[]

args

)

[static]

Reimplemented from edu.mit.csail.sdg.squander.examples.bst.BST_noParent.

Definition at line 70 of file BalancedBST.java.

References edu.mit.csail.sdg.squander.examples.bst.BST_noParent.findNode(), edu.mit.csail.sdg.squander.examples.bst.BST_noParent.insertKey_squander(), edu.mit.csail.sdg.squander.examples.bst.BST_noParent.removeNode_squander(), and edu.mit.csail.sdg.squander.examples.bst.BST_noParent.repOk().

void edu.mit.csail.sdg.squander.examples.bst.BalancedBST.removeNode_squander

(

Node

nodeToRemove

)

Reimplemented from edu.mit.csail.sdg.squander.examples.bst.BST_noParent.

Definition at line 66 of file BalancedBST.java.

boolean edu.mit.csail.sdg.squander.examples.bst.BalancedBST.repOk

(

)

Reimplemented from edu.mit.csail.sdg.squander.examples.bst.BST_noParent.

Definition at line 28 of file BalancedBST.java.

---

Member Data Documentation

final int [] edu.mit.csail.sdg.squander.examples.bst.BalancedBST.diff = new int[] {-1, 0, 1} [private]

Definition at line 25 of file BalancedBST.java.

---

The documentation for this class was generated from the following file:

• examples/edu/mit/csail/sdg/squander/examples/bst/BalancedBST.java