Data-Structure/wooyoung/src/test/java/com/dataStructure/collections/binaryTree/BinarySearchTreeImplTest.java at 93950dfb19c0c1e23897caf1a15089e63b2cf298 · hell-study-class/Data-Structure · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
package com.dataStructure.collections.binaryTree;

import org.junit.jupiter.api.Test;

class BinarySearchTreeImplTest {

    @Test
    void 왼쪽자식노드만_존재하는경우_삭제_테스트() {
        BinarySearchTree tree = new BinarySearchTreeImpl(3);
        tree.add(1);
        tree.add(2);
        tree.add(6);
        tree.add(4);
        tree.add(5);

        tree.remove(6);

        tree.preorder();
    }

    @Test
    void 리프노드_식제_테스트() {
        BinarySearchTree tree = new BinarySearchTreeImpl(3);
        tree.add(1);
        tree.add(2);
        tree.add(7);
        tree.add(6);
        tree.add(4);
        tree.add(5);

        tree.remove(4);
        tree.preorder();
    }

    @Test
    void 오른쪽_노드가_존재하는경우_삭제_테스트() {
        BinarySearchTree tree = new BinarySearchTreeImpl(3);
        tree.add(1);
        tree.add(2);
        tree.add(6);
        tree.add(4);
        tree.add(5);

        tree.remove(4);
        tree.preorder();
    }

    @Test
    void 전위순회_테스트() {
        BinarySearchTree tree = new BinarySearchTreeImpl(3);
        tree.add(1);
        tree.add(4);
        tree.add(2);
        tree.preorder();
    }

    @Test
    void 중위순회_테스트() {
        BinarySearchTree tree = new BinarySearchTreeImpl(3);
        tree.add(1);
        tree.add(4);
        tree.add(2);
        tree.inorder();
    }

    @Test
    void 후위순회_테스트() {
        BinarySearchTree tree = new BinarySearchTreeImpl(3);
        tree.add(1);
        tree.add(4);
        tree.add(2);
        tree.preorder();
    }

}