Package bst

Examples of bst.BSTree

14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
    while ((ch = System.in.read()) != 10) {
      sb.append((char) ch);
    }
    String[] input = sb.toString().split(";");

    BSTree tree = new BSTree();
    tree.create_empty();
   
    for (int i = 0; i < input.length; ++i) {
      String[] rational = input[i].split("/");
      Rational rat = null;
      if(rational.length==2)
        rat = new Rational(Integer.parseInt(rational[0]), Integer.parseInt(rational[1]));
     
      if(rational.length == 1)
        rat = new Rational(Integer.parseInt(rational[0]), 1);
     
      if(rat != null)
        tree.insert(rat);
    }
   
    System.out.println(tree.inord_transverse());
  }
View Full Code Here
6
7
8
9
10
11
12
13
14
15
16
17
18
public class TestBinarySearchTree {

  @Test
  public void testCreateEmptyGivesEmpty() {
    BSTree tree = new BSTree();
    tree.create_empty();
   
    boolean expected = true;
    boolean actual = tree.is_empty();
   
    assertEquals(expected, actual);
  }
View Full Code Here
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
    assertEquals(expected, actual);
  }
 
  @Test
  public void testInsertGivesNotEmpty(){
    BSTree tree = new BSTree();
    tree.create_empty();
   
    tree.insert(2.345);
   
    boolean expected = false;
    boolean actual = tree.is_empty();
   
    assertEquals(expected, actual);
  }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
    assertEquals(expected, actual);
  }
 
  @Test
  public void testInordTransverseAddingOne(){
    BSTree tree = new BSTree();
    tree.create_empty();
   
    tree.insert(2.345);
   
    String expected = "2.345";
    String actual = tree.inord_transverse();
   
    assertEquals(expected, actual);
  }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
    assertEquals(expected, actual);
  }
 
  @Test
  public void testInordTransverseAddingTwo(){
    BSTree tree = new BSTree();
    tree.create_empty();
   
    tree.insert(2.345);
    tree.insert(4.5622);
   
    String expected = "2.345 - 4.5622";
    String actual = tree.inord_transverse();
   
    assertEquals(expected, actual);
  }
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
    assertEquals(expected, actual);
  }
 
  @Test
  public void testInordTransverseAddingThree(){
    BSTree tree = new BSTree();
    tree.create_empty();
   
    tree.insert(2.345);
    tree.insert(4.5622);
    tree.insert(1.456);
   
    String expected = "1.456 - 2.345 - 4.5622";
    String actual = tree.inord_transverse();
   
    assertEquals(expected, actual);
  }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
    assertEquals(expected, actual);
  }
 
  @Test
  public void testInordTransverseAddingFour(){
    BSTree tree = new BSTree();
    tree.create_empty();
   
    tree.insert(2.345);
    tree.insert(4.5622);
    tree.insert(1.456);
    tree.insert(0);
   
    String expected = "0.0 - 1.456 - 2.345 - 4.5622";
    String actual = tree.inord_transverse();
   
    assertEquals(expected, actual);
   
    tree.create_empty();
   
    tree.insert(2.345);
    tree.insert(4.5622);
    tree.insert(1.456);
    tree.insert(5);
   
    expected = "1.456 - 2.345 - 4.5622 - 5.0";
    actual = tree.inord_transverse();
   
    assertEquals(expected, actual);
  }
View Full Code Here
TOP

Related Classes of bst.BSTree

  • test.TestBinarySearchTree
  • UseRationalBst
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.