AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.test.RedBlackTreeTest Class Reference

Public Member Functions

void testRedBlackTree ()
 

Static Public Member Functions

static void main (String args[])
 

Detailed Description

Definition at line 9 of file RedBlackTreeTest.java.

Member Function Documentation

◆ main()

static void aud.test.RedBlackTreeTest.main ( String  args[])
static

Definition at line 32 of file RedBlackTreeTest.java.

32 {
33 org.junit.runner.JUnitCore.main("aud.test.RedBlackTreeTest");
34 }

◆ testRedBlackTree()

void aud.test.RedBlackTreeTest.testRedBlackTree ( )

Definition at line 12 of file RedBlackTreeTest.java.

12 {
13 String[] keys={"a","b","c","d","e","f","g","h","i"};
14 int n=keys.length;
15
16 for (int[] p : new Permutations(n)) {
17
18 RedBlackTree<String,String> tree=new RedBlackTree<String,String>();
19
20 for (int i : p) {
21 String k=tree.find(keys[i]);
22 assertEquals(k,null);
23 tree.insert(keys[i],keys[i]);
24 k=tree.find(keys[i]);
25 assertTrue(k!=null);
26 assertTrue(k.compareTo(keys[i])==0);
27 tree.checkConsistency();
28 }
29 }
30 }

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