algorithms-and-data-structures/AlgorithmsAndDataStructures.Tests/DataStructures/AvlTree/AvlTreeTests.cs at master · arst/algorithms-and-data-structures · 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
76
77
78
79
80
81
82
83
84
85
86
using System;
using Xunit;

namespace AlgorithmsAndDataStructures.Tests.DataStructures.AvlTree;

public class AvlTreeTests
{
    [Fact]
    public void CanInsertRootNode()
    {
        var sut = new AlgorithmsAndDataStructures.DataStructures.AdelsonVelskyLandisTree.AvlTree();
        sut.Insert(10);
        Assert.True(sut.IsBalanced);
    }

    [Fact]
    public void SimpleTreeIsBalanced()
    {
        var sut = new AlgorithmsAndDataStructures.DataStructures.AdelsonVelskyLandisTree.AvlTree();
        sut.Insert(10);
        sut.Insert(11);
        sut.Insert(9);
        Assert.True(sut.IsBalanced);
    }

    [Fact]
    public void TreeIsBalancedWhenUnbalanceIsEqualToOne()
    {
        var sut = new AlgorithmsAndDataStructures.DataStructures.AdelsonVelskyLandisTree.AvlTree();
        sut.Insert(10);
        sut.Insert(11);
        sut.Insert(9);
        sut.Insert(8);
        Assert.True(sut.IsBalanced);
    }

    [Fact]
    public void CanDeleteRootNode()
    {
        var sut = new AlgorithmsAndDataStructures.DataStructures.AdelsonVelskyLandisTree.AvlTree();
        sut.Insert(10);
        sut.Delete(10);
        Assert.True(sut.IsBalanced);
    }

    [Fact]
    public void CanDeleteRightNonRootNode()
    {
        var sut = new AlgorithmsAndDataStructures.DataStructures.AdelsonVelskyLandisTree.AvlTree();
        sut.Insert(10);
        sut.Insert(11);
        sut.Delete(10);
        Assert.True(sut.IsBalanced);
    }

    [Fact]
    public void CanDeleteLeftNonRootNode()
    {
        var sut = new AlgorithmsAndDataStructures.DataStructures.AdelsonVelskyLandisTree.AvlTree();
        sut.Insert(10);
        sut.Insert(11);
        sut.Delete(10);
        Assert.True(sut.IsBalanced);
    }

    [Fact]
    public void TreeIsRebalanacedAfterDelete()
    {
        var sut = new AlgorithmsAndDataStructures.DataStructures.AdelsonVelskyLandisTree.AvlTree();
        var random = new Random();
        var seed = new int[10000];

        for (var j = 0; j < seed.Length; j++)
        {
            seed[j] = random.Next(100000);
            sut.Insert(seed[j]);
            Assert.True(sut.IsBalanced);
        }

        for (var j = 0; j < seed.Length; j++)
        {
            sut.Delete(seed[j]);
            Assert.True(sut.IsBalanced);
        }
    }
}