advanced-algorithms/tests/Advanced.Algorithms.Tests/DataStructures/Tree/BinaryTree_Tests.cs at develop · justcoding121/advanced-algorithms · 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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
using System;
using System.Linq;
using Advanced.Algorithms.DataStructures;
using Microsoft.VisualStudio.TestTools.UnitTesting;

namespace Advanced.Algorithms.Tests.DataStructures
{
    [TestClass]
    public class BinaryTreeTests
    {
        /// <summary>
        ///     A tree test
        /// </summary>
        [TestMethod]
        public void BinaryTree_Test()
        {
            var tree = new BinaryTree<int>();
            Assert.AreEqual(tree.GetHeight(), -1);

            tree.Insert(0, 0);
            Assert.AreEqual(tree.GetHeight(), 0);

            tree.Insert(0, 1);
            Assert.AreEqual(tree.GetHeight(), 1);

            tree.Insert(0, 2);
            Assert.AreEqual(tree.GetHeight(), 1);

            tree.Insert(1, 3);
            Assert.AreEqual(tree.GetHeight(), 2);

            try
            {
                tree.Delete(0);
            }
            catch (Exception e)
            {
                Assert.IsTrue(e.Message.StartsWith("Cannot delete two child node"));
            }

            //IEnumerable test using linq count()
            Assert.AreEqual(tree.Count, tree.Count());

            Assert.AreEqual(tree.GetHeight(), 2);

            tree.Delete(1);
            Assert.AreEqual(tree.GetHeight(), 1);

            tree.Delete(3);
            Assert.AreEqual(tree.GetHeight(), 1);

            tree.Delete(2);
            Assert.AreEqual(tree.GetHeight(), 0);

            tree.Delete(0);
            Assert.AreEqual(tree.GetHeight(), -1);

            tree.Insert(0, 0);
            Assert.AreEqual(tree.GetHeight(), 0);

            tree.Insert(0, 1);
            Assert.AreEqual(tree.GetHeight(), 1);

            tree.Insert(0, 2);
            Assert.AreEqual(tree.GetHeight(), 1);

            tree.Insert(1, 3);
            Assert.AreEqual(tree.GetHeight(), 2);

            //IEnumerable test using linq count()
            Assert.AreEqual(tree.Count, tree.Count());
        }

        [TestMethod]
        public void BinaryTree_Empty_SingleNode_DeleteRoot_Enumerate()
        {
            var tree = new BinaryTree<int>();

            Assert.AreEqual(0, tree.Count);
            Assert.AreEqual(0, tree.Count());
            Assert.IsFalse(tree.HasItem(1));
            Assert.AreEqual(0, tree.Children(1).Count());
            Assert.ThrowsException<ArgumentException>(() => tree.Delete(1));

            tree.Insert(0, 1);
            Assert.AreEqual(1, tree.Count);
            Assert.IsTrue(tree.HasItem(1));
            CollectionAssert.AreEqual(new[] { 1 }, tree.ToList());

            tree.Delete(1);
            Assert.AreEqual(0, tree.Count);
            Assert.AreEqual(0, tree.Count());

            tree.Insert(0, 1);
            tree.Insert(1, 2);
            tree.Delete(1);
            Assert.AreEqual(1, tree.Count);
            Assert.IsTrue(tree.HasItem(2));
            Assert.IsFalse(tree.HasItem(1));
            CollectionAssert.AreEqual(new[] { 2 }, tree.ToList());
        }

        [TestMethod]
        public void BinaryTree_TwoChild_Delete_Throws_And_Enumerate()
        {
            var tree = new BinaryTree<int>();
            tree.Insert(0, 0);
            tree.Insert(0, 1);
            tree.Insert(0, 2);
            Assert.ThrowsException<InvalidOperationException>(() => tree.Delete(0));

            tree.Delete(1);
            Assert.IsFalse(tree.HasItem(1));
            Assert.AreEqual(2, tree.Count);
            Assert.AreEqual(2, tree.Count());
            Assert.IsTrue(tree.HasItem(0));
            Assert.IsTrue(tree.HasItem(2));
        }
    }
}